Dynamic Pricing and Inventory Control with Fixed Ordering Cost and Incomplete Demand Information

Published Online:https://doi.org/10.1287/mnsc.2021.4171

References

  • Abbasi-Yadkori Y, Pál D, Szepesvári C (2011) Improved algorithms for linear stochastic bandits. Shawe-Taylor J, Zemel RS, Bartlett PL, Pereira F, Weinberger KQ, eds. Adv. Neural Information Processing Systems, vol. 24 (Curran Associates, Red Hook, NY), 2312–2320.Google Scholar
  • Agrawal S, Jia R (2019) Learning in structured mdps with convex cost functions: Improved regret bounds for inventory management. Karlin A, ed. Proc. ACM Conf. Econom. Comput. (ACM, New York), 743–744.Google Scholar
  • Auer P (2002) Using confidence bounds for exploitation-exploration trade-offs. J. Machine Learning Res. 3(Nov):397–422.Google Scholar
  • Ban G-Y (2020) Confidence intervals for data-driven inventory policies with demand censoring. Oper. Res. 68(2):309–326.AbstractGoogle Scholar
  • Ban G-Y, Keskin NB (2021) Personalized dynamic pricing with machine learning: High dimensional features and heterogeneous elasticity. Management Sci. 67(9):5549–5568.Google Scholar
  • Ban G-Y, Rudin C (2018) The big data newsvendor: Practical insights from machine learning. Oper. Res. 67(1):90–108.LinkGoogle Scholar
  • Ban G-Y, Gao Z, Taigel F (2020) Model mis-specification in newsvendor decisions: A comparison of frequentist parametric, bayesian parametric and nonparametric approaches. Preprint, posted January 1, https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3495733.Google Scholar
  • Besbes O, Muharremoglu A (2013) On implications of demand censoring in the newsvendor problem. Management Sci. 59(6):1407–1424.LinkGoogle 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.LinkGoogle Scholar
  • Besbes O, Zeevi A (2012) Blind network revenue management. Oper. Res. 60(6):1537–1550.LinkGoogle 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.LinkGoogle Scholar
  • Broder J, Rusmevichientong P (2012) Dynamic pricing under a general parametric choice model. Oper. Res. 60(4):965–980.LinkGoogle Scholar
  • Bu J, Simchi-Levi D, Wang L (2020) Offline pricing and demand learning with censored data. Preprint, posted July 1, https://dx.doi.org/10.2139/ssrn.3619625.Google Scholar
  • Burnetas AN, Smith CE (2000) Adaptive ordering and pricing for perishable products. Oper. Res. 48(3):436–443.LinkGoogle Scholar
  • Chao X, Zhou SX (2006) Joint inventory-and-pricing strategy for a stochastic continuous-review system. IIE Trans. 38(5):401–408.CrossrefGoogle Scholar
  • Chen B, Shi C (2019a) Tailored base-surge policies in dual-sourcing inventory systems with demand learning. Preprint, posted September 27, https://dx.doi.org/10.2139/ssrn.3456834.Google Scholar
  • Chen B, Chao X, Ahn H-S (2019a) Coordinating pricing and inventory replenishment with nonparametric demand learning. Oper. Res. 67(4):1035–1052.AbstractGoogle Scholar
  • Chen B, Chao X, Shi C (2021) Nonparametric algorithms for joint pricing and inventory control with lost-sales and censored demand. Math. Oper. Res. 46(2):726–756.LinkGoogle Scholar
  • Chen B, Chao X, Wang Y (2020a) Data-based dynamic pricing and inventory control with censored demand and limited price changes. Oper. Res. 68(5):1445–1456.LinkGoogle Scholar
  • Chen B, Wang Y, Zhou Y (2020b) Optimal policies for dynamic pricing and inventory control with nonparametric censored demands. Preprint, Posted December 17, https://dx.doi.org/10.2139/ssrn.3750413.Google Scholar
  • Chen L, Plambeck EL (2008) Dynamic inventory management with learning about the demand distribution and substitution probability. Manufacturing Service Oper. Management 10(2):236–256.LinkGoogle Scholar
  • Chen Q, Jasin S, Duenyas I (2019b) Nonparametric self-adjusting control for joint learning and optimization of multiproduct pricing with finite resource capacity. Math. Oper. Res. 44(2):601–631.LinkGoogle Scholar
  • Chen X, Simchi-Levi D (2004a) Coordinating inventory control and pricing strategies with random demand and fixed ordering cost: The finite horizon case. Oper. Res. 52(6):887–896.LinkGoogle Scholar
  • Chen X, Simchi-Levi D (2004b) Coordinating inventory control and pricing strategies with random demand and fixed ordering cost: The infinite horizon case. Math. Oper. Res. 29(3):698–723.LinkGoogle Scholar
  • Chen X, Simchi-Levi D (2006) Coordinating inventory control and pricing strategies: The continuous review model. Oper. Res. Lett. 34(3):323–332.CrossrefGoogle Scholar
  • Chen X, Simchi-Levi D, Philips R, Ozer O, eds. (2012) Pricing and Inventory Management (Oxford University Press, Oxford, UK).CrossrefGoogle Scholar
  • Chen Y, Shi C (2019b) Network revenue management with online inverse batch gradient descent method. Preprint, posted February 26, https://dx.doi.org/10.2139/ssrn.3331939.Google Scholar
  • Chen Y, Ray S, Song Y (2006) Optimal pricing and inventory control policy in periodic-review systems with fixed ordering cost and lost sales. Naval Res. Logist. 53(2):117–136.CrossrefGoogle Scholar
  • Cheung WC, Simchi-Levi D (2019) Sampling-based approximation schemes for capacitated stochastic inventory control models. Math. Oper. Res. 44(2):668–692.LinkGoogle Scholar
  • Cheung WC, Simchi-Levi D, Wang H (2017) Dynamic pricing and demand learning with limited price experimentation. Oper. Res. 65(6):1722–1731.LinkGoogle Scholar
  • Dani V, Hayes TP, Kakade SM (2008) Stochastic linear optimization under bandit feedback. Servedio RA, Zhang T, eds. Proc. Conf. Learn. Theory (Omnipress, Madison, WI), 355–366.Google Scholar
  • den Boer AV, Keskin NB (2020) Discontinuous demand functions: Estimation and pricing. Management Sci. 66(10):4516–4534.LinkGoogle Scholar
  • den Boer AV, Zwart B (2014) Simultaneously learning and optimizing using controlled variance pricing. Management Sci. 60(3):770–783.LinkGoogle Scholar
  • Dvoretzky A, Kiefer J, Wolfowitz J (1956) Asymptotic minimax character of the sample distribution function and of the classical multinomial estimator. Ann. Math. Statist. 27(3):642–669.CrossrefGoogle Scholar
  • 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.LinkGoogle Scholar
  • Federgruen A, Heching A (1999) Combined pricing and inventory control under uncertainty. Oper. Res. 47(3):454–475.LinkGoogle Scholar
  • Feng Y, Chen FY (2003) Joint Pricing and Inventory Control with Setup Costs and Demand Uncertainty (The Chinese University of Hong Kong, Hong Kong).Google Scholar
  • Ferreira KJ, Simchi-Levi D, Wang H (2018) Online network revenue management using thompson sampling. Oper. Res. 66(6):1586–1602.LinkGoogle Scholar
  • Filippi S, Cappe O, Garivier A, Szepesvári C (2010) Parametric bandits: The generalized linear case. Lafferty JD, Williams CKI, Shawe-Taylor J, Zemel RS, Culotta A, eds. Adv. Neural Inform. Processing Systems, vol. 23 (Curran Associates, Red Hook, NY), 586–594.Google Scholar
  • Fournier N, Guillin A (2015) On the rate of convergence in wasserstein distance of the empirical measure. Probability Theory Related Fields 162(3-4):707–738.CrossrefGoogle Scholar
  • Harrison JM, Keskin NB, Zeevi A (2012) Bayesian dynamic pricing policies: Learning and earning under a binary prior distribution. Management Sci. 58(3):570–586.LinkGoogle Scholar
  • Hu P, Lu Y, Song M (2019) Joint pricing and inventory control with fixed and convex/concave variable production costs. Production Oper. Management 28(4):847–877.CrossrefGoogle Scholar
  • Huh WT, Janakiraman G (2008) (s, s) optimality in joint inventory-pricing control: An alternate approach. Oper. Res. 56(3):783–790.LinkGoogle Scholar
  • Huh WT, Rusmevichientong P (2009) A nonparametric asymptotic analysis of inventory planning with censored demand. Math. Oper. Res. 34(1):103–123.LinkGoogle Scholar
  • Huh WT, Janakiraman G, Muckstadt JA, Rusmevichientong P (2009) An adaptive algorithm for finding the optimal base-stock policy in lost sales inventory systems with censored demand. Math. Oper. Res. 34(2):397–416.LinkGoogle Scholar
  • Huh WT, Levi R, Rusmevichientong P, Orlin JB (2011) Adaptive data-driven inventory control with censored demand based on kaplan-meier estimator. Oper. Res. 59(4):929–941.LinkGoogle Scholar
  • Jin C, Yang Z, Wang Z, Jordan MI (2019) Provably efficient reinforcement learning with linear function approximation. Preprint, July 11, https://arxiv.org/abs/1907.05388.Google Scholar
  • Kantorovich LV, Rubinstein GS (1958) On a space of completely additive functions. Vestnik Leningradskogo Universiteta 13(7):52–59.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.LinkGoogle Scholar
  • Keskin NB, Li Y, Song J-SJ (2022) Data-driven dynamic pricing and ordering with perishable inventory in a changing environment. Management Sci. Forthcoming.Google Scholar
  • Levi R, Perakis G, Uichanco J (2015) The data-driven newsvendor problem: New bounds and insights. Oper. Res. 63(6):1294–1306.LinkGoogle Scholar
  • Levi R, Roundy RO, Shmoys DB (2007) Provably near-optimal sampling-based policies for stochastic inventory control models. Math. Oper. Res. 32(4):821–839.LinkGoogle Scholar
  • Li Y, Wang Y, Zhou Y (2019) Nearly minimax-optimal regret for linearly parameterized bandits. Preprint, March 30, https://arxiv.org/abs/1904.00242.Google Scholar
  • Massart P (1990) The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality. Ann. Probabilities 18(3):1269–1283.CrossrefGoogle Scholar
  • Nambiar M, Simchi-Levi D, Wang H (2019) Dynamic learning and pricing with model misspecification. Management Sci. 65(11):4980–5000.LinkGoogle Scholar
  • Petruzzi NC, Dada M (1999) Pricing and the newsvendor problem: A review with extensions. Oper. Res. 47(2):183–194.LinkGoogle Scholar
  • Polatoglu H, Sahin I (2000) Optimal procurement policies under price dependent demand. Internat. J. Production Econom. 65:141–171.CrossrefGoogle Scholar
  • Qin H, Simchi-Levi D, Wang L (2019) Data-driven approximation schemes for joint pricing and inventory control models. Preprint, submitted March 25, https://dx.doi.org/10.2139/ssrn.3354358.Google Scholar
  • Rusmevichientong P, Tsitsiklis JN (2010) Linearly parameterized bandits. Math. Oper. Res. 35(2):395–411.LinkGoogle Scholar
  • Shi C, Chen W, Duenyas I (2016) Nonparametric data-driven algorithms for multiproduct inventory systems with censored demand. Oper. Res. 64(2):362–370.LinkGoogle Scholar
  • Song Y, Ray S, Boyaci T (2009) Optimal dynamic joint inventory-pricing control for multiplicative demand with fixed order costs and lost sales. Oper. Res. 57(1):245–250.LinkGoogle Scholar
  • Thomas LJ (1974) Price and production decisions with random demand. Oper. Res. 22(3):513–518.LinkGoogle Scholar
  • Wang Y, Chen B, Simchi-Levi D (2019) Multi-modal dynamic pricing. Management Sci. 67(10):5969–6627.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.LinkGoogle Scholar
  • Yang J (2020) Learning the best price and ordering policy under fixed costs and ambiguous demand. Preprint, posted April 9, https://dx.doi.org/10.2139/ssrn.3554042.Google Scholar
  • Yano CA, Gilbert SM, Eliashberg J, Chakravarty A, eds. (2003) Coordinated Pricing and Production/Procurement Decisions: A Review (Kluwer, Norwell, MA).Google Scholar
  • Yin R, Rajaram K (2007) Joint pricing and inventory control with a Markovian demand model. Eur. J. Oper. Res. 182(1):113–126.CrossrefGoogle Scholar
  • Yuan H, Luo Q, Shi C (2019) Marrying stochastic gradient descent with bandits: Learning algorithms for inventory systems with fixed costs. Management Sci. 67(10):6089–6115.Google Scholar
  • Zhang H, Chao X, Shi C (2018) Perishable inventory systems: Convexity results for base-stock policies and learning algorithms under censored demand. Oper. Res. 66(5):1276–1286.LinkGoogle Scholar
  • Zhang H, Chao X, Shi C (2020) Closing the gap: A learning algorithm for lost-sales inventory systems with lead times. Management Sci. 66(5):1962–1980.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.