Coordinating Pricing and Inventory Replenishment with Nonparametric Demand Learning

References

• Agarwal S, Devanur NR (2014) Bandits with concave rewards and convex knapsacks. Proc. 15th ACM Conf. Econom. Comput. (ACM, Palo Alto, CA), 989–1006.Crossref, Google Scholar
• Agarwal S, Devanur NR (2016) Linear contextual bandits with knapsacks. Lee DD, Sugiyama M, Luxburg UV, Guyon I, Garnett R, eds. Advances in Neural Information Processing Systems (NIPS) (Curran Associates Inc., Red Hook, NY), 3450–3458.Google Scholar
• Agarwal A, Foster DP, Hsu DJ, Kakade SM, Rakhlin A (2011) Stochastic convex optimization with bandit feedback. Shawe-Taylor J, Zemel RS, Bartlett PL, Pereira FCN, Weinberger KQ, eds. Advances in Neural Information Processing Systems (NIPS) (Curran Associates Inc., Red Hook, NY), 1035–1043.Google Scholar
• Auer P, Ortner R, Szepesvari C (2007) Improved rates for the stochastic continuum-armed bandit problem. Proc. 20th Internat. Conf. Learn. Theory (COLT) (Springer, Berlin, Heidelberg), 454–468.Crossref, Google Scholar
• Badanidiyuru A, Kleinberg R, Slivkins A (2013) Bandits with knapsacks. Proc. Foundations Comput. Sci. (FOCS), 2013 IEEE 54th Annual Sympos. (IEEE Computer Society, Washington, DC), 207–216.Crossref, 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
• Buche R, Kushner HJ (2002) Rate of convergence for constrained stochastic approximation algorithms. SIAM J. Control Optim. 40(4):1011–1041.Crossref, Google Scholar
• Burnetas AN, Smith CE (2000) Adaptive ordering and pricing for perishable products. Oper. Res. 48(3):436–443.Link, Google Scholar
• Chen X, Simchi-Levi D (2004) Coordinating inventory control and pricing strategies with random demand and fixed ordering cost: The finite horizon case. Oper. Res. 52(6):887–896.Link, Google Scholar
• Chen X, Simchi-Levi D (2012) Pricing and inventory management. Philips R, Ozalp O, eds. The Handbook of Pricing Management (Oxford University Press, Oxford, UK), 784–822.Crossref, Google Scholar
• Cope EW (2009) Regret and convergence bounds for a class of continuum-armed bandit problems. Automatic Control IEEE Trans. 54(6):1243–1253.Crossref, Google Scholar
• Denardo EV, Feinberg EA, Rothblum UG (2013) The multi-armed bandit, with constraints. Ann. Oper. Res. 208(1):37–62.Crossref, Google Scholar
• Ding W, Qin T, Zhang XD, Liu TY (2013) Multi-armed bandit with budget constraint and variable costs. Proc. 27th AAAI Conf. Artificial Intelligence (AAAI, Palo Alto, CA), 232–238.Google 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.Link, Google Scholar
• Federgruen A, Heching A (1999) Combined pricing and inventory control under uncertainty. Oper. Res. 47(3):454–475.Link, 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
• Guha S, Munagala K (2009) Multi-armed bandits with metric switching costs. Albers S, Marchetti-Spaccamela A, Matias Y, Nikoletseas S, Thomas W, eds. Automata, Languages and Programming. ICALP 2009. Lecture Notes in Computer Science, vol. 5556 (Springer, Berlin, Heidelberg), 496–507.Crossref, Google Scholar
• Hazan E, Kalai A, Kale S, Agarwal A (2006) Logarithmic regret algorithms for online convex optimization. Lugosi G, Simon H-U, eds. Proc. Internat. Conf. Computational Learn. Theory (COLT) (Springer, Berlin, Heidelberg), 499–513.Crossref, Google Scholar
• Huh WT, Rusmevichientong P (2009) A nonparametric asymptotic analysis of inventory planning with censored demand. Math. Oper. Res. 34(1):103–123.Link, Google 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.Link, 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
• Kiefer J, Wolfowitz J (1952) Stochastic estimation of the maximum of a regression function. Ann. Math. Statist. 23(3):462–466.Crossref, Google Scholar
• Kleinberg RD (2005) Nearly tight bounds for the continuum-armed bandit problem. Weiss Y, Schölkopf B, Platt J, eds. Advances in Neural Information Processing Systems (NIPS) (Curran Associates, Red Hook, NY), 697–704.Google Scholar
• Kleywegt AJ, Shapiro A, Homem-de-mello T (2001) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
• Kushner H (2010) Stochastic approximation: A survey. Wiley Interdisciplinary Rev. Comput. Statist. 2(1):87–96.Crossref, Google Scholar
• Kushner HJ, Yin G (1997) Stochastic Approximation Algorithms and Applications (Springer-Verlag, New York).Crossref, Google Scholar
• Kushner H, Yin G (2003). Stochastic Approximation and Recursive Algorithms and Applications (Springer Science & Business Media, Berlin).Google Scholar
• Lai TL, Robbins H (1981) Consistency and asymptotic efficiency of slope estimates in stochastic approximation schemes. Probab. Theory Related Fields 56(3):329–360.Google Scholar
• Levi R, Perakis G, Uichanco J (2015) The data-driven newsvendor problem: New bounds and insights. Oper. Res. 63(6):1294–1306.Link, Google 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.Link, Google Scholar
• Petruzzi NC, Dada M (1999) Pricing and the newsvendor problem: A review with extensions. Oper. Res. 47(2):183–194.Link, Google Scholar
• Robbins H, Monro S (1951) A stochastic approximation method. Ann. Math. Statist. 22(3):400–407.Crossref, Google Scholar
• Vershynin R (2018) High-Dimensional Probability: An Introduction with Applications in Data Science, vol. 47 (Cambridge University Press, Cambridge, UK).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
• Wu CF (1986) Jackknife, bootstrap and other resampling methods in regression analysis. Ann. Statist. 14(4):1261–1295.Crossref, Google Scholar
• Yano CA, Gilbert SM (2003) Coordinated pricing and production/procurement decisions: A review. Eliashberg J, Chakravarty A, eds. Managing Business Interfaces: Marketing, Engineering, and Manufacturing Perspectives (Kluwer, Norwell, MA), 65–104.Google Scholar
• Zinkevich M (2003) Online convex programming and generalized infinitesimal gradient ascent. Fawcett T, Mishra N, eds. Proc. 20th Internat. Conf. Machine Learn. (ICML) (AAAI Press, Menlo Park, CA), 928–936.Google Scholar