Pricing a Finite Inventory of Substitutable Products with Show-All Constraint

References

• Akçay Y, Natarajan HP, Xu SH (2010) Joint dynamic pricing of multiple perishable products under consumer choice. Management Sci. 56(8):1345–1361.Link, Google Scholar
• Aouad A, Sarıtaç Ö (2022) Dynamic stochastic matching under limited time. Oper. Res. 70(4):2349–2383.Link, Google Scholar
• Ashlagi I, Shi P (2016) Optimal allocation without money: An engineering approach. Management Sci. 62(4):1078–1097.Link, Google Scholar
• Avadhanula V, Bhandari J, Goyal V, Zeevi A (2016) On the tightness of an LP relaxation for rational optimization and its applications. Oper. Res. Lett. 44(5):612–617.Crossref, Google Scholar
• Balseiro SR, Besbes O, Pizarro D (2024) Survey of dynamic resource-constrained reward collection problems: Unified model and analysis. Oper. Res. 72(5):2168–2189.Link, Google Scholar
• Bitran G, Caldentey R (2003) An overview of pricing models for revenue management. Manufacturing Service Oper. Management 5(3):203–229.Link, Google Scholar
• Blanchet J, Gallego G, Goyal V (2016) A Markov chain approximation to choice modeling. Oper. Res. 64(4):886–905.Link, Google Scholar
• Block HD, Marschak J (1959) Random orderings and stochastic theories of response. Cowles Foundation Discussion Paper No. 66, Cowles Foundation for Research in Economics, Yale University.Google Scholar
• Borle S, Boatwright P, Kadane JB, Nunes JC, Galit S (2005) The effect of product assortment changes on customer retention. Marketing Sci. 24(4):616–622.Link, Google Scholar
• Cao Y, Kleywegt AJ, Wang H (2022) Network revenue management under a spiked multinomial logit choice model. Oper. Res. 70(4):2237–2253.Link, Google Scholar
• Cao Y, Rusmevichientong P, Topaloglu H (2023) Revenue management under a mixture of independent demand and multinomial logit models. Oper. Res. 71(2):603–625.Google Scholar
• Chan CW, Farias VF (2009) Stochastic depletion problems: Effective myopic policies for a class of dynamic optimization problems. Math. Oper. Res. 34(2):333–350.Link, Google Scholar
• Chen X, Ma W, Simchi-Levi D, Xin L (2024) Assortment planning for recommendations at checkout under inventory constraints. Math. Oper. Res. 49(1):297–325.Link, Google Scholar
• Cheung WC, Simchi-Levi D (2016) Efficiency and performance guarantees for choice-based network revenue management problems with flexible products. Preprint, submitted August 15, https://doi.org/10.2139/ssrn.2823339.Google Scholar
• Dai J, Ding W, Kleywegt A, Wang X, Zhang Y (2014) Choice based revenue management for parallel flights. Preprint, submitted March 8, https://doi.org/10.2139/ssrn.2404193.Google Scholar
• Den Boer AV (2015) Dynamic pricing and learning: Historical origins, current research, and new directions. Surveys Oper. Res. Management Sci. 20(1):1–18.Crossref, Google Scholar
• Dong L, Kouvelis P, Tian Z (2009) Dynamic pricing and inventory control of substitute products. Manufacturing Service Oper. Management 11(2):317–339.Link, Google Scholar
• Dong J, Simsek AS, Topaloglu H (2019) Pricing problems under the markov chain choice model. Production Oper. Management 28(1):157–175.Crossref, Google Scholar
• Elmachtoub AN, Goyal V, Lederman R, Sheth H (2022) Revenue management with product retirement and customer selection. Preprint, submitted February 16, https://doi.org/10.2139/ssrn.4033922.Google Scholar
• Feldman BJ, Topaloglu H (2017) Revenue management under the Markov chain choice model. Oper. Res. 65(5):1322–1342.Link, Google Scholar
• Feng Y, Niazadeh R, Saberi A (2022) Near-optimal Bayesian online assortment of reusable resources. Immorlica N, Pennock D, eds. Proc. 23rd ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 964–965.Google Scholar
• Fishburn PC (1992) Induced binary probabilities and the linear ordering polytope: A status report. Math. Soc. Sci. 23(1):67–80.Crossref, Google Scholar
• Gallego G, Topaloglu H (2014) Constrained assortment optimization for the nested logit model. Management Sci. 60(10):2583–2601.Link, Google Scholar
• Gallego G, Topaloglu H (2019) Revenue Management and Pricing Analytics, International Series in Operations Research and Management Science, vol. 279 (Springer, New York).Crossref, Google Scholar
• Gallego G, van Ryzin G (1994) Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management Sci. 40(8):999–1020.Link, Google Scholar
• Gallego G, van Ryzin G (1997) A multiproduct dynamic pricing problem and its applications to network yield management. Oper. Res. 45(1):24–41.Link, Google Scholar
• Gallego G, Ratliff R, Shebalov S (2015) A general attraction model and sales-based linear program for network revenue management under customer choice. Oper. Res. 63(1):212–232.Link, Google Scholar
• Gallego G, Iyengar G, Phillips R, Dubey A (2020) Managing flexible products on a network. Preprint, submitted April 27, https://doi.org/10.2139/ssrn.3567371.Google Scholar
• Ganz A, Nuti P, Schwartz R (2023) A tight competitive ratio for online submodular welfare maximization. Gørtz IL, Farach-Colton M, Puglisi SJ, Herman G, eds. Proc. 31st Annual Eur. Sympos. Algorithms, vol. 274 (Schloss Dagstuhl–Leibniz-Zentrum fur Informatik), 52:1–52:17.Google Scholar
• Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• Gong XY, Goyal V, Iyengar GN, Simchi-Levi D, Udwani R, Wang S (2022) Online assortment optimization with reusable resources. Management Sci. 68(7):4772–4785.Link, Google Scholar
• Goyal V, Iyengar G, Udwani R (2025) Asymptotically optimal competitive ratio for online allocation of reusable resources. Oper. Res. 73(4):1897–1915.Google Scholar
• Kapralov M, Post I, Vondrák J (2013) Online submodular welfare maximization: Greedy is optimal. Khanna S, ed. Proc. 24th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 1216–1225.Google Scholar
• Karp RM, Vazirani UV, Vazirani VV (1990) An optimal algorithm for on-line bipartite matching. Ortiz H, ed. Proc. 22nd Annual ACM Sympos. Theory Comput. (ACM, New York), 352–358.Google Scholar
• Kök A, Fisher M, Vaidyanathan R (2015) Assortment planning: Review of literature and industry practice. Agrawal N, Smith SA, eds. Retail Supply Chain Management, International Series in Operations Research & Management Science (Springer US), 175–236.Crossref, Google Scholar
• Luce RD (1959) Individual Choice Behavior: A Theoretical Analysis (John Wiley & Sons, New York).Google Scholar
• Ma W, MacRury C, Zhang J (2024) Online contention resolution schemes for network revenue management and combinatorial auctions. Saraf S, ed. 17th Innovations Theoret. Comput. Sci. Conf. (Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Wadern, Germany), 100:1.Google Scholar
• Ma W, Simchi-Levi D, Zhao J (2021) Dynamic pricing (and assortment) under a static calendar. Management Sci. 67(4):2292–2313.Link, Google Scholar
• Maglaras C, Meissner J (2006) Dynamic pricing strategies for multiproduct revenue management problems. Manufacturing Service Oper. Management 8(2):136–148.Link, Google Scholar
• McFadden D (1973) Conditional logit analysis of qualitative choice behavior. Zarembka P, ed. Frontiers in Econometrics.Google Scholar
• McFadden D (1978) Modeling the choice of residential location. Transporation Res. Rec. 673.Google Scholar
• Mehta A (2013) Online matching and ad allocation. Foundations Trends Theoretical Comput. Sci. 8(4):265–368.Crossref, Google Scholar
• Plackett RL (1975) The analysis of permutations. J. Roy. Statist. Soc. Ser. C (Appl. Statist.) 24(2):193–202.Google Scholar
• Raghavan P, Motwani R (1995) Randomized Algorithms (Cambridge University Press, Cambridge, UK).Google Scholar
• Sethuraman R, Gázquez-Abad JC, Martínez-López FJ (2022) The effect of retail assortment size on perceptions, choice, and sales: Review and research directions. J. Retailing 98(1):24–45.Crossref, Google Scholar
• Sumida M, Gallego G, Rusmevichientong P, Topaloglu H, Davis J (2021) Revenue-utility tradeoff in assortment optimization under the multinomial logit model with totally unimodular constraints. Management Sci. 67(5):2845–2869.Link, Google Scholar
• Sun S, Udwani R, Shen ZJM (2025) A unified algorithmic framework for dynamic assortment optimization under MNL choice. Proc. 26th ACM Conf. Econom. Comput. (ACM, New York), 789–789.Google Scholar
• Talluri K, van Ryzin G (2004) Revenue management under a general discrete choice model of consumer behavior. Management Sci. 50(1):15–33.Link, Google Scholar
• Topaloglu H (2013) Joint stocking and product offer decisions under the multinomial logit model. Production Oper. Management 22(5):1182–1199.Crossref, Google Scholar
• Udwani R (2025a) Optimality of non-adaptive algorithms in online submodular welfare maximization with stochastic outcomes. Ashlagi I, Roth A, eds. Proc. 26th ACM Conf. Econom. Comput. (ACM, New York), 1.Google Scholar
• Udwani R (2025b) Submodular order functions and assortment optimization. Management Sci. 71(1):202–218.Abstract, Google Scholar
• Vera A, Banerjee S, Gurvich I (2021) Online allocation and pricing: Constant regret via bellman inequalities. Oper. Res. 69(3):821–840.Link, Google Scholar
• Williams HC (1977) On the formation of travel demand models and economic evaluation measures of user benefit. Environment Planning A 9(3):285–344.Crossref, Google Scholar