Dynamic Pricing with External Information and Inventory Constraint

References

• Agrawal S, Devanur NR (2014) Bandits with concave rewards and convex knapsacks. Proc. 15th ACM Conf. Econom. Comput., 989–1006.Google Scholar
• Araman VF, Caldentey R (2009) Dynamic pricing for nonperishable products with demand learning. Oper. Res. 57(5):1169–1188.Link, Google Scholar
• Auer P, Gajane P, Ortner R (2019) Adaptively tracking the best bandit arm with an unknown number of distribution changes. Conf. Learn. Theory (PMLR), 138–158.Google Scholar
• Badanidiyuru A, Kleinberg R, Slivkins A (2013) Bandits with knapsacks. IEEE 54th Annual Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 207–216.Google Scholar
• Balseiro S, Kroer C, Kumar R (2022) Online resource allocation under horizon uncertainty. Preprint, submitted June 27, https://arxiv.org/abs/2206.13606.Google Scholar
• Ban GY, Keskin NB (2021) Personalized dynamic pricing with machine learning: High-dimensional features and heterogeneous elasticity. Management Sci. 67(9):5549–5568.Link, Google Scholar
• Bertsekas DP (1995) Dynamic Programming and Optimal Control, vol. 1 (Athena Scientific, Belmont, MA).Google Scholar
• Besbes O, Muharremoglu A (2013) On implications of demand censoring in the newsvendor problem. Management Sci. 59(6):1407–1424.Link, Google Scholar
• Besbes O, Zeevi A (2009) Dynamic pricing without knowing the demand function: Risk bounds and near-optimal algorithms. Oper. Res. 57(6):1407–1420.Link, Google Scholar
• Besbes O, Zeevi A (2012) Blind network revenue management. Oper. Res. 60(6):1537–1550.Link, Google Scholar
• 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
• Besbes O, Gur Y, Zeevi A (2014) Stochastic multi-armed-bandit problem with non-stationary rewards. Adv. Neural Inform. Processing Systems, vol. 27.Google Scholar
• Besbes O, Gur Y, Zeevi A (2015) Non-stationary stochastic optimization. Oper. Res. 63(5):1227–1244.Link, Google Scholar
• Broder J, Rusmevichientong P (2012) Dynamic pricing under a general parametric choice model. Oper. Res. 60(4):965–980.Link, Google Scholar
• Bu J, Simchi-Levi D, Xu Y (2019) Online pricing with offline data: Phase transition and inverse square law. Preprint, submitted October 19, https://arxiv.org/abs/1910.08693.Google Scholar
• Bu J, Simchi-Levi D, Xu Y (2020) Online pricing with offline data: Phase transition and inverse square law. Internat. Conf. Machine Learn. (PMLR), 1202–1210.Google Scholar
• Bumpensanti P, Wang H (2018) A re-solving heuristic with uniformly bounded loss for network revenue management. Preprint, submitted February 17, https://arxiv.org/abs/1802.06192.Google Scholar
• Chen B, Chao X (2019) Parametric demand learning with limited price explorations in a backlog stochastic inventory system. IISE Trans. 51(6):605–613.Crossref, Google Scholar
• Chen B, Chao X, Ahn HS (2019) Coordinating pricing and inventory replenishment with nonparametric demand learning. Oper. Res. 67(4):1035–1052.Abstract, Google Scholar
• Chen B, Chao X, Shi C (2017) Nonparametric algorithms for joint pricing and inventory control with lost-sales and censored demand. Preprint, submitted September 10, 2016, https://dx.doi.org/10.2139/ssrn.2836057.Google Scholar
• Chen B, Chao X, Wang Y (2020) Data-based dynamic pricing and inventory control with censored demand and limited price changes. Oper. Res. 68(5):1445–1456.Link, Google Scholar
• Chen N, Gallego G (2018a) Nonparametric learning and optimization with covariates. Preprint, submitted May 3, https://arxiv.org/abs/1805.01136.Google Scholar
• Chen N, Gallego G (2018b) A primal-dual learning algorithm for personalized dynamic pricing with an inventory constraint. Preprint, submitted January 2, 2019, https://dx.doi.org/10.2139/ssrn.3301153.Google Scholar
• Chen X, Owen Z, Pixton C, Simchi-Levi D (2015) A statistical learning approach to personalization in revenue management. Preprint, submitted March 18, https://dx.doi.org/10.2139/ssrn.2579462.Google Scholar
• Chen Y, Shi C (2019a) Joint pricing and inventory management with strategic customers. Oper. Res. 67(6):1610–1627.Link, Google Scholar
• Chen Y, Shi C (2019b) Network revenue management with online inverse batch gradient descent method. Preprint, submitted February 26, https://dx.doi.org/10.2139/ssrn.3331939.Google Scholar
• Cheung WC, Simchi-Levi D, Wang H (2017) Dynamic pricing and demand learning with limited price experimentation. Oper. Res. 65(6):1722–1731.Link, Google Scholar
• Cheung WC, Simchi-Levi D, Zhu R (2019) Non-stationary reinforcement learning: The blessing of (more) optimism. Preprint, submitted June 7, https://arxiv.org/abs/1906.02922.Google Scholar
• Cheung WC, Simchi-Levi D, Zhu R (2022) Hedging the drift: Learning to optimize under nonstationarity. Management Sci. 68(3):1696–1713.Link, Google Scholar
• Cohen M, Lobel I, Paes Leme R (2016) Feature-based dynamic pricing. Preprint, submitted February 29, https://dx.doi.org/10.2139/ssrn.2737045.Google Scholar
• den Boer A, Keskin NB (2019) Dynamic pricing with demand learning and reference effects. Preprint, submitted December 29, 2017, https://dx.doi.org/10.2139/ssrn.3092745.Google Scholar
• den Boer AV (2014) Dynamic pricing with multiple products and partially specified demand distribution. Math. Oper. Res. 39(3):863–888.Link, 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
• den Boer AV, Zwart B (2014) Simultaneously learning and optimizing using controlled variance pricing. Management Sci. 60(3):770–783.Link, Google Scholar
• den Boer AV, Zwart B (2015) Dynamic pricing and learning with finite inventories. Oper. Res. 63(4):965–978.Link, Google Scholar
• Farias VF, Van Roy B (2010) Dynamic pricing with a prior on market response. Oper. Res. 58(1):16–29.Link, Google Scholar
• Feng Q, Zhu R, Jasin S (2022) Phase transitions in learning and earning under price protection guarantee. Preprint, submitted November 3, https://arxiv.org/abs/2211.01798.Google Scholar
• Ferreira KJ, Simchi-Levi D, Wang H (2018) Online network revenue management using Thompson sampling. Oper. Res. 66(6):1586–1602.Link, Google Scholar
• Freund D, Banerjee S (2019) Good prophets know when the end is near. Preprint, submitted November 25, https://dx.doi.org/10.2139/ssrn.3479189.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
• Gill RD, Levit BY (1995) Applications of the van trees inequality: A Bayesian Cramér-Rao bound. Bernoulli 1(1–2):59–79.Crossref, Google Scholar
• Jasin S (2014) Reoptimization and self-adjusting price control for network revenue management. Oper. Res. 62(5):1168–1178.Link, Google Scholar
• 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
• Jasin S, Kumar S (2012) A re-solving heuristic with bounded revenue loss for network revenue management with customer choice. Math. Oper. Res. 37(2):313–345.Link, Google Scholar
• Javanmard A, Nazerzadeh H (2016) Dynamic pricing in high-dimensions. Preprint, submitted September 24, https://arxiv.org/abs/1609.07574.Google Scholar
• Keskin NB, Zeevi A (2014) Dynamic pricing with an unknown demand model: Asymptotically optimal semi-myopic policies. Oper. Res. 62(5):1142–1167.Link, Google Scholar
• Keskin NB, Zeevi A (2018) On incomplete learning and certainty-equivalence control. Oper. Res. 66(4):1136–1167.Link, Google Scholar
• Keskin NB, Li Y, Song JS (2022) Data-driven dynamic pricing and ordering with perishable inventory in a changing environment. Management Sci. 68(3):1938–1958.Link, Google Scholar
• Lattimore T, Szepesvári C (2020) Bandit Algorithms (Cambridge University Press, Cambridge).Crossref, Google Scholar
• Lei YM, Jasin S, Sinha A (2014) Near-optimal bisection search for nonparametric dynamic pricing with inventory constraint. Ross School of Business Paper 1252, Ann Arbor, MI.Google Scholar
• Li X, Ye Y (2021) Online linear programming: Dual convergence, new algorithms, and regret bounds. Oper. Res. 70(5):2948–2966.Link, Google Scholar
• Liu Y, Chen N (2022) Dynamic pricing with money-back guarantees. Production Oper. Management 31(3):941–962.Crossref, Google Scholar
• Luenberger DG, Ye Y (1984) Linear and Nonlinear Programming, vol. 2 (Springer).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
• Nambiar M, Simchi-Levi D, Wang H (2019) Dynamic learning and pricing with model misspecification. Management Sci. 65(11):4980–5000.Link, Google Scholar
• Qiang S, Bayati M (2016) Dynamic pricing with demand covariates. Preprint, submitted April 18, https://dx.doi.org/10.2139/ssrn.2765257.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
• Simchi-Levi D, Xu Y, Zhao J (2019) Network revenue management with limited switches: Known and unknown demand distributions. Preprint, submitted December 6, https://dx.doi.org/10.2139/ssrn.3479477.Google Scholar
• Talluri K, Van Ryzin G (1998) An analysis of bid-price controls for network revenue management. Management Sci. 44(11):1577–1593.Link, Google Scholar
• Wang Y, Zheng Z (2021) Measuring policy performance in online pricing with offline data. Preprint, submitted January 21, https://dx.doi.org/10.2139/ssrn.3729003.Google Scholar
• Wang Z, Deng S, Ye Y (2014) Close the gaps: A learning-while-doing algorithm for single-product revenue management problems. Oper. Res. 62(2):318–331.Link, Google Scholar
• Yuan H, Luo Q, Shi C (2021) Marrying stochastic gradient descent with bandits: Learning algorithms for inventory systems with fixed costs. Management Sci. 67(10):6089–6115.Link, Google Scholar