Nonparametric Self-Adjusting Control for Joint Learning and Optimization of Multiproduct Pricing with Finite Resource Capacity

References

• [1] Atar R, Reiman M (2012) Asymptotically optimal dynamic pricing for network revenue management. Stochastic Systems 2(2):232–276.Link, Google Scholar
• [2] Auer P, Cesa-Bianchi N, Fischer P (2002) Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2–3):235–256.Crossref, Google Scholar
• [3] Auer P, Cesa-Bianchi N, Freund Y, Schapire R (2002) The nonstochastic multiarmed bandit problem. SIAM J. Comput. 32(1):48–77.Crossref, Google Scholar
• [4] Badanidiyuru A, Kleinberg R, Slivkins A (2013) Bandits with knapsacks. FOCS ’13 Proc. 2013 IEEE 54th Annual Sympos. on Foundations of Computer Science (IEEE Computer Society, Washington, DC), 207–216.Crossref, Google Scholar
• [5] Badanidiyuru A, Kleinberg R, Slivkins A (2015) Bandits with knapsacks. Working paper, Cornell University, Ithaca, NY.Google Scholar
• [6] Besbes O, Zeevi A (2009) Dynamic pricing without knowing the demand function: Risk bound and near-optimal algorithms. Oper. Res. 57(6):1407–1420.Link, Google Scholar
• [7] Besbes O, Zeevi A (2012) Blind network revenue management. Oper. Res. 60(6):1537–1550.Link, Google Scholar
• [8] Besbes O, Zeevi A (2015) On the (surprising) sufficiency of linear models for dynamic pricing with demand learning. Management Sci. 61(4):723–739.Link, Google Scholar
• [9] Bitran G, Caldentey R (2003) An overview of pricing models for revenue management. Manufacturing Service Oper. Management 5(3):203–229.Link, Google Scholar
• [10] Bonnans J, Shapiro A (2000) Perturbation Analysis of Optimization Problems (Springer, New York).Crossref, Google Scholar
• [11] Broder J, Rusmevichientong P (2012) Dynamic pricing under a general parametric choice model. Oper. Res. 60(4):965–980.Link, Google Scholar
• [12] Chen Q, Jasin S, Duenyas I (2016) Real-time pricing with minimal and flexible price adjustment. Management Sci. 62(8):2437–2455.Link, Google Scholar
• [13] Chen Q, Jasin S, Duenyas I (2017) Nonparametric self-adjusting control: An extension to compound Poisson process. Working paper, University of Michigan, Ann Arbor.Google Scholar
• [14] Combes R, Jiang C, Srikant R (2015) Bandits with budgets: Regret lower bounds and optimal algorithms. Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (Association for Computing Machinery, New York), 245–257.Crossref, Google Scholar
• [15] Elmaghraby W, Keskinocak P (2003) Dynamic pricing in the presence of inventory considerations: Research overview, current practices, and future directions. Management Sci. 49(10):1287–1309.Link, Google Scholar
• [16] Ferreira KJ, Simchi-Levi D, Wang H (2018) Online network revenue management using Thompson sampling. Oper. Res. 66(6):1586–1602.Link, Google Scholar
• [17] Flajolet A, Jaillet P (2017) Logarithmic regret bounds for bandits with knapsacks. Working paper, Massachusetts Institute of Technology, Cambridge.Google Scholar
• [18] Gallego G, van Ryzin G (1994) Optimal dynamic pricing of inventory with stochastic demand over finite horizons. Management Sci. 40(8):999–1020.Link, Google Scholar
• [19] 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
• [20] Gyorfi L, Kohler M, Krzyzak A, Walk H (2002) A Distribution-Free Theory of Nonparametric Regression (Springer, New York).Crossref, Google Scholar
• [21] Jasin S (2014) Reoptimization and self-adjusting price control for network revenue management. Oper. Res. 62(5):1168–1178.Link, Google Scholar
• [22] Jasin S (2015) Performance of an LP-based control for revenue management with unknown demand parameters. Oper. Res. 63(4):909–915.Link, Google Scholar
• [23] Keskin N, Zeevi A (2014) Dynamic pricing with an unknown demand model: Asymptotically optimal semi-myopic policies. Oper. Res. 62(5):1142–1167.Link, Google Scholar
• [24] Lai T, Robbins H (1985) Asymptotic efficient adaptive allocation rules. Adv. Appl. Math. 6(1):4–22.Crossref, Google Scholar
• [25] Lei Y, Jasin S, Sinha A (2014) Near-optimal bisection search for nonparametric dynamic pricing with inventory constraint. Working paper, Ross School of Business, Ann Arbor, Michigan.Google Scholar
• [26] Maglaras C, Meissner J (2006) Dynamic pricing strategies for multiproduct revenue management problems. Manufacturing Service Oper. Management 8(2):136–148.Link, Google Scholar
• [27] Ozer O, Phillips R (2012) The Oxford Handbook of Pricing Management (Oxford University Press, New York).Crossref, Google Scholar
• [28] Schumaker L (2007) Spline Functions: Basic Theory, 3rd ed. (Cambridge University Press, New York).Crossref, Google Scholar
• [29] Talluri K, van Ryzin G (2005) The Theory and Practice of Revenue Management (Springer, New York).Crossref, Google Scholar
• [30] Wang Z, Deng S, Ye Y (2014) Closing the gaps: A learning-while-doing algorithm for single-product revenue management problems. Oper. Res. 62(2):318–331.Link, Google Scholar