Kohli Rajeev

Rajeev Kohli

Information about the author Rajeev Kohli will soon be added to the site.
Found 17 papers in total
Relation Between EBA and Nested Logit Models
2017
We show that elimination by aspects (EBA) generalizes nested logit and...
Error Theory for Elimination by Aspects
2015
Elimination by aspects (EBA) is a random utility model that is considered to represent...
The Design of Durable Goods
2011
The use of a durable good is limited by both its physical life and usable life. For...
Package size decisions
2010
We describe a model examining how a firm might choose the package size and price for a...
Conflict resolution in the scheduling of television commercials
2009
We extend a previous model for scheduling commercial advertisements during breaks in...
Representation and inference of lexicographic preference models and their variants
2007
The authors propose two variants of lexicographic preference rules. They obtain the...
Some empirical regularities in market shares
2006
We present some empirical regularities in the market shares of brands. Our...
Average performance of greedy heuristics for the integer knapsack problem
2004
This paper derives a lower bound on the average performance of a total-value greedy...
Capacitated location problems on a line
1996
This paper examines capacitated facility location problems on a straight line. To...
Capacitated location problems on a line
1996
This paper examines capacitated facility loction problems on a straight line. To serve...
Capacitated location problem on a line
1996
This paper examines capacitated facility location problems on a straight line. To...
Joint performance of greedy heuristics for the integer knapsack problem
1995
This paper analzyes the worst-case performance of combinations of greedy heuristics...
Coordinating buyer-seller transactions across multiple products
1994
Joint ordering policies are examined as a method for reducing the transactions cost...
A total-value greedy heuristic for the integer knapsack problem
1992
This paper examines a new greedy heuristic for the integer knapsack problem. The...
Heuristics for product-line design using conjoint analysis
1990
Recently proposed methods for product-line selection use the total utilities of...
Optimal product design using conjoint analysis: Computational complexity and algorithms
1989
The problem of maximizing the share of a new product introduced in a competitive...
A cooperative game theory model of quantity discounts
1989
Quantity discounts offered by a monopolist are considered in the context of a...
Papers per page: