IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

Revenue Management Under a General Discrete Choice Model of Consumer Behavior

Listed author(s):
  • Kalyan Talluri


    (Department of Economics and Business, Universitat Pompeu Fabra, Ramon Trias Fargas 25-27, 08005 Barcelona, Spain)

  • Garrett van Ryzin


    (Graduate School of Business, Columbia University, New York, New York 10027)

Registered author(s):

    Customer choice behavior, such as buy-up and buy-down, is an important phenomenon in a wide range of revenue management contexts. Yet most revenue management methodologies ignore this phenomenon---or at best approximate it in a heuristic way. In this paper, we provide an exact and quite general analysis of this problem. Specifically, we analyze a single-leg reserve management problem in which the buyers' choice behavior is modeled explicitly. The choice model is very general, simply specifying the probability of purchase for each fare product as a function of the set of fare products offered. The control problem is to decide which subset of fare products to offer at each point in time. We show that the optimal policy for this problem has a quite simple form. Namely, it consists of identifying an ordered family of "efficient" subsets S 1 , ..., S m , and at each point in time opening one of these sets S k , where the optimal index k is increasing in the remaining capacity x and decreasing in the remaining time. That is, the more capacity (or less time) available, the further the optimal set is along this sequence. We also show that the optimal policy is a nested allocation policy if and only if the sequence of efficient sets is nested, that is S 1 \subseteq S 2 \subseteq ... \subseteq S m . Moreover, we give a characterization of when nesting by fare order is optimal. We also develop an estimation procedure for this setting based on the expectation-maximization (EM) method that jointly estimates arrival rates and choice model parameters when no-purchase outcomes are unobservable. Numerical results are given to illustrate both the model and estimation procedure.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    Download Restriction: no

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 50 (2004)
    Issue (Month): 1 (January)
    Pages: 15-33

    in new window

    Handle: RePEc:inm:ormnsc:v:50:y:2004:i:1:p:15-33
    Contact details of provider: Postal:
    7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA

    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Web page:

    More information through EDIRC

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    in new window

    1. Guillermo Gallego & Garrett van Ryzin, 1994. "Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons," Management Science, INFORMS, vol. 40(8), pages 999-1020, August.
    2. Youyi Feng & Guillermo Gallego, 2000. "Perishable Asset Revenue Management with Markovian Time Dependent Demand Intensities," Management Science, INFORMS, vol. 46(7), pages 941-956, July.
    3. Kalyan Talluri & Garrett van Ryzin, 1998. "An Analysis of Bid-Price Controls for Network Revenue Management," Management Science, INFORMS, vol. 44(11-Part-1), pages 1577-1593, November.
    4. Dror, Moshe & Trudeau, Pierre & Ladany, Shaul P., 1988. "Network models for seat allocation on flights," Transportation Research Part B: Methodological, Elsevier, vol. 22(4), pages 239-250, August.
    5. Michael A. Crew & Paul R. Kleindorfer, 1976. "Peak Load Pricing with a Diverse Technology," Bell Journal of Economics, The RAND Corporation, vol. 7(1), pages 207-231, Spring.
    Full references (including those not matched with items on IDEAS)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:50:y:2004:i:1:p:15-33. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.