Online Assortment Optimization with Reusable Resources

References

• Baek J, Ma W (2019) Bifurcating constraints to improve approximation ratios for network revenue management with reusable resources. Preprint, submitted December 15, https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3482457.Google Scholar
• Ball MO, Queyranne M (2009) Toward robust revenue management: Competitive analysis of online booking. Oper. Res. 57(4):950–963.Link, Google Scholar
• Berbeglia G, Garassino A, Vulcano G (2021) A comparative empirical study of discrete choice models in retail operations. Management Sci. Forthcoming.Link, Google Scholar
• Bernstein F, Kök AG, Xie L (2015) Dynamic assortment customization with limited inventories. Manufacturing Service Oper. Management 17(4):538–553.Link, Google Scholar
• Blanchet JH, Gallego G, Goyal V (2016) A Markov chain approximation to choice modeling. Oper. Res. 64(4):886–905.Link, Google Scholar
• Budhiraja A, Mukherjee D, Wu R (2019) Supermarket model on graphs. Ann. Appl. Probab. 29(3):1740–1777.Crossref, 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 Y, Levi R, Shi C (2017) Revenue management of reusable resources with advanced reservations. Production Oper. Management 26(5):836–859.Crossref, Google Scholar
• Cruise J, Jonckheere M, Shneer S (2020) Stability of jsq in queues with general server-job class compatibilities. Queueing Systems 95:271–279.Crossref, Google Scholar
• Davis JM, Gallego G, Topaloglu H (2014) Assortment optimization under variants of the nested logit model. Oper. Res. 62(2):250–273.Link, Google Scholar
• Devanur NR, Jain K, Kleinberg RD (2013) Randomized primal-dual analysis of ranking for online bipartite matching. Proc. 24th Annual ACM-SIAM Sympos. Discrete Algorithms SODA ’13 (USA: Society for Industrial and Applied Mathematics), 101–107.Google Scholar
• Dickerson JP, Sankararaman KA, Srinivasan A, Xu P (2018) Allocation problems in ride-sharing platforms: Online matching with offline reusable resources. McIlraith SA, Weinberger KQ, eds. Proc. 32nd AAAI Conf. Artificial Intelligence (AAAI-18) (AAAI Press), 1007–1014.Google Scholar
• Feng Y, Niazadeh R, Saberi A (2019) Linear programming based online policies for real-time assortment of reusable resources. Preprint, submitted July 17, https://dx.doi.org/10.2139/ssrn.3421227.Google Scholar
• Feng Y, Niazadeh R, Saberi A (2020) Near-optimal bayesian online assortment of reusable resources. Preprint, submitted October 21, https://ssrn.com/abstract=3714338.Google Scholar
• Gallego G, Iyengar G, Phillips R, Dubey A (2004) Managing flexible products on a network. Preprint, submitted April 27, https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3567371.Google Scholar
• Gallego G, Topaloglu H (2014) Constrained assortment optimization for the nested logit model. Management Sci. 60(10):2583–2601.Link, Google Scholar
• Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• Goyal V, Iyengar G, Udwani R (2020a) Online allocation of reusable resources: Achieving optimal competitive ratio. Preprint, submitted February 6, https://arxiv.org/abs/2002.02430.Google Scholar
• Goyal V, Iyengar G, Udwani R (2020b) Online allocation of reusable resources via algorithms guided by fluid approximations. Preprint, submitted October 8, https://arxiv.org/abs/2010.03983.Google Scholar
• Goyal V, Iyengar G, Udwani R (2021) Asymptotically optimal competitive ratio for online allocation of reusable resources. Preprint, submitted February 6, https://arxiv.org/abs/2002.02430.Google Scholar
• Goyal V, Udwani R (2020) Online matching with stochastic rewards: Optimal competitive ratio via path based formulation. Proc. 21st ACM Conf. Econom. Comput. EC ’20 (Association for Computing Machinery, New York), 791.Google Scholar
• Karp RM, Vazirani UV, Vazirani VV (1990) An optimal algorithm for on-line bipartite matching. Proc. 22nd Annual ACM Sympos. Theory Comput., STOC ’90 (Association for Computing Machinery, 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, volume 223 of International Series in Operations Research & Management Science (Springer, New York), 175–236.Google Scholar
• Levi R, Radovanović A (2010) Provably near-optimal lp-based policies for revenue management in systems with reusable resources. Oper. Res. 58(2):503–507.Link, Google Scholar
• Liu Q, van Ryzin GJ (2008) On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management 10(2):288–310.Link, Google Scholar
• Luce RD (1959) Individual Choice Behavior: A Theoretical Analysis (Wiley, New York).Google Scholar
• Ma W, Simchi-Levi D (2020) Algorithms for online matching, assortment, and pricing with tight weight-dependent competitive ratios. Oper. Res. 68(6):1787–1803.Link, Google Scholar
• McFadden D (1973) Conditional logit analysis of qualitative choice behavior. Zarembka P, ed. Frontiers in Econometrics (Academic Press, New York), 105–142.Google Scholar
• McFadden D (1978) Modelling the choice of residential location. Karlqvist A, Lundqvist L, Snickars F, Weibull J, eds. Spatial Interaction Theory and Planning Models (North Holland, Amsterdam), 75–6.Google Scholar
• McFadden D, Train K (2000) Mixed MNL models for discrete response. J. Appl. Econometrics 15(5):447–470.Crossref, Google Scholar
• Mehta A (2013) Online matching and ad allocation. Foundation Trends Theoret. Comput. Sci. 8(4):265–368.Crossref, Google Scholar
• Mukherjee D, Borst SC, van Leeuwaarden JSH (2018) Asymptotically optimal load balancing topologies. Proc. ACM Measurement Anal. Comput. Systems 14:1–29.Google Scholar
• Owen Z, Simchi-Levi D (2018) Price and assortment optimization for reusable resources. Preprint, revised February 20, https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3070625.Google Scholar
• Plackett RL (1975) The analysis of permutations. J. Roy. Statist. Soc.: Ser. C. Appl. Statist. 24(2):193–202.Google Scholar
• Rusmevichientong P, Sumida M, Topaloglu H (2020) Dynamic assortment optimization for reusable products with random usage durations. Management Sci. 66(7):2820–2844.Link, Google Scholar
• Stein C, Truong VA, Wang X (2018) Advance service reservations with heterogeneous customers. Management Sci. 66(7):2801–3294.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
• Train KE (2009) Discrete Choice Methods with Simulation (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Wang X, Truong VA, Bank D (2018) Online advance admission scheduling for services with customer preferences. Preprint, submitted May 26, https://arxiv.org/abs/1805.10412.Google Scholar
• Weng W, Zhou X, Srikant R (2020) Optimal load balancing with locality constraints. Proc. ACM Measurement Anal. Comput. Systems 45:1–37.Google Scholar
• Williams HW (1977) On the formation of travel demand models and economic evaluation measures of user benefit. Environ. Planning A 3(9):285–344.Crossref, Google Scholar