The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Revenue Management Under a General Discrete Choice Model of Consumer Behavior
Open accessAbstract
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⊆ S 2⊆ … ⊆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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Conditional logit analysis of qualitative choice behavior
McFadden, D. L. (1972) · eScholarship (California Digital Library) · Cited by 14,203
(1995) · Cited by 10,558
Cragg, J. G., & Zarembka, P. (1975) · The Canadian Journal of Economics · doi:10.2307/134075 · Cited by 8,342
The EM Algorithm and Extensions
Kushary, D. (1998) · Technometrics · doi:10.1080/00401706.1998.10485534 · Cited by 5,417
Inequalities: Theory of Majorization and its Applications.
Arnold, B. C., Marshall, A. W., & Olkin, I. (1981) · Journal of the American Statistical Association · doi:10.2307/2287859 · Cited by 4,870
On the Convergence Properties of the EM Algorithm
Wu, C. F. J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346060 · Cited by 3,269
When choice is demotivating: can one desire too much of a good thing?
Iyengar, S. S., & Lepper, M. R. (2000) · Journal of Personality and Social Psychology · doi:10.1037/0022-3514.79.6.995 · Cited by 2,878 · cited 1×
“The earliest work on capacity control was Littlewood’s (1972) analysis of a simple, two-fare–class model of capacity allocations on a single flight leg.”
Introduction to linear optimization
Bertsimas, D., & Tsitsiklis, J. N. (1997) · Cited by 2,705
Freimer, M., Bellman, R. E., & Dreyfus, S. E. (1964) · Journal of the American Statistical Association · doi:10.2307/2282884 · Cited by 2,153
Cited by
Appointment Scheduling in Health Care: Challenges and Opportunities
Gupta, D., & Denton, B. (2008) · IIE Transactions · doi:10.1080/07408170802165880 · Cited by 1,043
“Such models have the potential to improve appointment scheduling via algorithmic decision support tools, similar to their successful application in other service industries such as the airlines, car rental agencies and hotels (see Talluri and Van Ryzin (2004a) ).”
BackgroundIntertemporal Pricing with Strategic Customer Behavior
Su, X. (2007) · Management Science · doi:10.1287/mnsc.1060.0667 · Cited by 613
An overview of research on revenue management: Current issues and future research
Chiang, W. C., Chen, J. C. H., & Xu, X. (2007) · International Journal of Revenue Management · doi:10.1504/ijrm.2007.011196 · Cited by 447
Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application
Kök, A. G., & Fisher, M. L. (2007) · Operations Research · doi:10.1287/opre.1070.0409 · Cited by 436
Assortment Planning: Review of Literature and Industry Practice
Kök, A. G., Fisher, M. L., & Vaidyanathan, R. (2008) · International Series in Operations Research & Management Science · doi:10.1007/978-0-387-78902-6_6 · Cited by 413
On the Choice-Based Linear Programming Model for Network Revenue Management
Liu, Q., & van Ryzin, G. (2008) · Manufacturing & Service Operations Management · doi:10.1287/msom.1070.0169 · Cited by 366
Self-citationShen, Z. M., & Su, X. (2007) · Production and Operations Management · doi:10.1111/j.1937-5956.2007.tb00291.x · Cited by 337
Dynamic Pricing and Inventory Control of Substitute Products
Dong, L., Kouvelis, P., & Tian, Z. (2009) · Manufacturing & Service Operations Management · doi:10.1287/msom.1080.0221 · Cited by 311
A Column Generation Algorithm for Choice-Based Network Revenue Management
Bront, J. J. M., Méndez-Díaz, I., & Vulcano, G. (2009) · Operations Research · doi:10.1287/opre.1080.0567 · Cited by 310
Dynamic Pricing Strategies for Multiproduct Revenue Management Problems
Maglaras, C., & Meissner, J. (2006) · Manufacturing & Service Operations Management · doi:10.1287/msom.1060.0105 · Cited by 307
A Nonparametric Approach to Modeling Choice with Limited Data
Farias, V. F., Jagabathula, S., & Shah, D. (2013) · Management Science · doi:10.1287/mnsc.1120.1610 · Cited by 304
Assortment Optimization Under Variants of the Nested Logit Model
Davis, J. M., Gallego, G., & Topaloglu, H. (2014) · Operations Research · doi:10.1287/opre.2014.1256 · Cited by 295
A Markov Chain Approximation to Choice Modeling
Blanchet, J., Gallego, G., & Goyal, V. (2016) · Operations Research · doi:10.1287/opre.2016.1505 · Cited by 288
Estimating Primary Demand for Substitutable Products from Sales Transaction Data
Vulcano, G., van Ryzin, G., & Ratliff, R. (2012) · Operations Research · doi:10.1287/opre.1110.1012 · Cited by 285
Self-citationAssortment Optimization under the Multinomial Logit Model with Random Choice Parameters
Rusmevichientong, P., Shmoys, D., Tong, C., & Topaloglu, H. (2014) · Production and Operations Management · doi:10.1111/poms.12191 · Cited by 279
Strategic and tactical price decisions in hotel revenue management
Abrate, G., & Viglia, G. (2016) · Tourism Management · doi:10.1016/j.tourman.2016.02.006 · Cited by 224
Passenger demand forecasting in scheduled transportation
Banerjee, N., Morton, A., & Akartunalı, K. (2020) · European Journal of Operational Research · doi:10.1016/j.ejor.2019.10.032 · Cited by 106
Integrated flight scheduling and fleet assignment with improved supply-demand interactions
Birolini, S., Antunes, A. P., Cattaneo, M., Malighetti, P., & Paleari, S. (2021) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2021.05.001 · Cited by 69
Optimal Multiperiod Pricing with Service Guarantees
Borgs, C., Candogan, O., Chayes, J., Lobel, I., & Nazerzadeh, H. (2014) · Management Science · doi:10.1287/mnsc.2013.1839 · Cited by 60
“We do not provide a summary of this line of literature here, but we refer the reader to excellent surveys by Talluri and van Ryzin (2004), Bitran and Caldentey (2003), Chan et al. (2004), Shen and Su (2007), and Aviv et al. (2009).”
BackgroundUnconstraining methods in revenue management systems: research overview and prospects
Guo, P., Xiao, B., & Li, J. (2012) · Advances in Operations Research · doi:10.1155/2012/270910 · Cited by 40
A game theoretic model for airline revenue management and competitive pricing
Isler, K., & Imhof, H. (2008) · Journal of Revenue and Pricing Management · doi:10.1057/rpm.2008.30 · Cited by 38
(2009) · Cited by 21
Khan, N. T., Aslam, J., Rauf, A. A., & Kim, Y. B. (2022) · Sustainability · doi:10.3390/su14063468 · Cited by 8
Abdelghany, A., Abdelghany, K., Guzhva, V. S., & Kai, M. (2025) · Journal of Air Transport Management · doi:10.1016/j.jairtraman.2025.102832 · Cited by 4
Metadata
- Authors
- Talluri, K., & van Ryzin, G.
- Venue
- Management Science
- Published
- 2004-01
- Volume
- 50
- Issue
- 1
- Pages
- 15-33
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2144425834
- Cited by
- 1,108
- References
- 42
- FWCI
- 29.16
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.