Technical Note—Near-Optimal Bayesian Online Assortment of Reusable Resources

References

• Adelman D (2007) Dynamic bid prices in revenue management. Oper. Res. 55(4):647–661.Link, Google Scholar
• Alaei S (2014) Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. SIAM J. Comput. 43(2):930–972.Crossref, Google Scholar
• Alaei S, Hajiaghayi MT, Liaghat V (2012) Online prophet-inequality matching with applications to ad allocation. Proc. 13th ACM Conf. Electr. Commerce (Association for Computing Machinery, New York), 18–35.Google Scholar
• Anari N, Niazadeh R, Saberi A, Shameli A (2019) Nearly optimal pricing algorithms for production constrained and laminar Bayesian selection. Proc. 2019 ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 91–92.Google Scholar
• Baek J, Ma W (2022) Bifurcating constraints to improve approximation ratios for network revenue management with reusable resources. Oper. Res. 70(4):2226–2236.Google Scholar
• Chawla S, Hartline JD, Malec DL, Sivan B (2010) Multi-parameter mechanism design and sequential posted pricing. Proc. 42nd ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 311–320.Google Scholar
• Devanur NR, Sivan B, Azar Y (2012) Asymptotically optimal algorithm for stochastic adwords. Proc. 13th ACM Conf. Electr. Commerce (Association for Computing Machinery, New York), 388–404.Google Scholar
• Dickerson J, Sankararaman K, Srinivasan A, Xu P (2018) Allocation problems in ride-sharing platforms: Online matching with offline reusable resources. Proc. AAAI Conf. Artificial Intelligence, vol. 32 (AAAI Press, Washington, DC).Google Scholar
• Gallego G, Li A, Truong V-A, Wang X (2015) Online personalized resource allocation with customer choice. Preprint, submitted November 5, https://arxiv.org/abs/1511.01837.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 (2020) Online allocation of reusable resources via algorithms guided by fluid approximations. Preprint, submitted October 8, https://arxiv.org/abs/2010.03983.Google Scholar
• Hajiaghayi MT, Kleinberg R, Sandholm T (2007) Automated online mechanism design and prophet inequalities. AAAI’07 Proc. 22nd National Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 58–65.Google Scholar
• Kök AG, Fisher ML, Vaidyanathan R (2008) Assortment planning: Review of literature and industry practice. Agrawal N, Smith S, eds. Retail Supply Chain Management, International Series in Operations Research & Management Science, vol. 223 (Springer, Boston), 99–153.Crossref, Google Scholar
• Lee YT Sidford A, Wong SC (2015) A faster cutting plane method and its implications for combinatorial and convex optimization. 2015 IEEE 56th Annual Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 1049–1065.Google Scholar
• Ma W, Simchi-Levi D, Zhao J (2020) Dynamic pricing (and assortment) under a static calendar. Management Sci. 67(4):2292–2313.Google Scholar
• Papadimitriou CH, Tsitsiklis JN (1987) The complexity of Markov decision processes. Math. Oper. Res. 12(3):441–450.Link, 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
• Rusmevichientong P, Shmoys D, Tong C, Topaloglu H (2014) Assortment optimization under the multinomial logit model with random choice parameters. Prod. Oper. Management 23(11):2023–2039.Crossref, Google Scholar
• Vaidya PM (1996) A new algorithm for minimizing convex functions over convex sets. Math. Programming 73(3):291–341.Crossref, Google Scholar
• Wang X, Truong V-H, Bank D (2018) Online advance admission scheduling for services with customer preferences. Preprint, submitted May 26, https://arxiv.org/abs/1805.10412.Google Scholar
• Zhang D, Adelman D (2009) An approximate dynamic programming approach to network revenue management with customer choice. Transportation Sci. 43(3):381–394.Link, Google Scholar