Discontinuous Demand Functions: Estimation and Pricing

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

References

  • Abbasi-Yadkori Y, Pál D, Szepesvári C (2011) Improved algorithms for linear stochastic bandits. Shawe-Taylor J, Zemel RS, Bartlett P, Pereira FCN, Weinberger KQ, eds. Advances in Neural Information Processing Systems, vol. 24 (Curran Associates, Red Hook, NY), 2312–2320.Google Scholar
  • Ackley G (1942) Spatial competition in a discontinuous market. Quart. J. Econom. 56(2):212–230.CrossrefGoogle Scholar
  • Araman V, Caldentey R (2009) Dynamic pricing for nonperishable products with demand learning. Oper. Res. 57(5):1169–1188.LinkGoogle Scholar
  • Auer P, Ortner R, Szepesvári C (2007) Improved rates for the stochastic continuum-armed bandit problem. Bshouty N, Gentile C, eds. Proc. 20th Annual Conf. Learn. Theory, COLT 2007, Lecture Notes in Computer Science, vol. 4539 (Springer, Berlin), 454–468.Google Scholar
  • Baye MR, Gatti JRJ, Kattuman P, Morgan J (2009) Clicks, discontinuities, and firm demand online. J. Econom. Management Strategy 18(4):935–975.CrossrefGoogle 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 (2011) On the minimax complexity of pricing in a changing environment. Oper. Res. 59(1):66–79.LinkGoogle Scholar
  • Blisard WN, Stewart H, Jolliffe D (2004) Low-income households’ expenditures on fruits and vegetables. Agricultural Economic Report AER-833, Economic Research Service, U.S. Department of Agriculture, Washington, DC.Google Scholar
  • Broder J, Rusmevichientong P (2012) Dynamic pricing under a general parametric choice model. Oper. Res. 60(4):965–980.LinkGoogle Scholar
  • Chien H-K, Chu CC (2008) Sale or lease? Durable-goods monopoly with network effects. Marketing Sci. 27(6):1012–1019.LinkGoogle Scholar
  • Cope EW (2009) Regret and convergence bounds for a class of continuum-armed bandit problems. IEEE Trans. Automatic Control 54(6):1243–1253.CrossrefGoogle Scholar
  • Cournot AA (1897) Researches into the Mathematical Principles of the Theory of Wealth, trans. Bacon NT (Macmillan Company, New York).Google Scholar
  • Dani V, Hayes TP, Kakade SM (2008) Stochastic linear optimization under bandit feedback. Servedio R, Zhang T, eds. Proc. 21st Annual Conf. Learn. Theory (COLT) (Omni Press, Helsinki, Finland), 355–366.Google Scholar
  • den Boer AV (2015a) Dynamic pricing and learning: Historical origins, current research, and new directions. Surveys Oper. Res. Management Sci. 20(1):1–18.CrossrefGoogle Scholar
  • den Boer AV (2015b) Tracking the market: Dynamic pricing and learning in a changing environment. Eur. J. Oper. Res. 247(3):914–927.CrossrefGoogle Scholar
  • den Boer AV, Zwart B (2014) Simultaneously learning and optimizing using controlled variance pricing. Management Sci. 60(3):770–783.LinkGoogle Scholar
  • den Boer AV, Zwart B (2015) Dynamic pricing and learning with finite inventories. Oper. Res. 63(4):965–978.LinkGoogle Scholar
  • Farias V, van Roy B (2010) Dynamic pricing with a prior on market response. Oper. Res. 58(1):16–29.LinkGoogle Scholar
  • Gallego G, van Ryzin G (1994) Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management Sci. 40(8):999–1020.LinkGoogle 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
  • Keskin NB (2014) Optimal dynamic pricing with demand model uncertainty: A squared-coefficient-of-variation rule for learning and earning. Working paper, Duke University, Durham, NC.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, Zeevi A (2016) Chasing demand: Learning and earning in a changing environment. Math. Oper. Res. 42(2):277–307.LinkGoogle Scholar
  • Kleinberg R (2005) Nearly tight bounds for the continuum-armed bandit problem. Saul LK, Weiss Y, Bottou L, eds. Advances in Neural Information Processing Systems, vol. 17 (Curran Associates, Red Hook, NY), 697–704.Google Scholar
  • Kleinberg R, Leighton T (2003) The value of knowing a demand curve: Bounds on regret for online posted-price auctions. Proc. 44th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS) (IEEE Computer Society, Washington, DC), 594–605.Google Scholar
  • Lattimore T, Szepesvári C (2019) Bandit algorithms. Accessed September 1, 2019, https://tor-lattimore.com/downloads/book/book.pdf.Google Scholar
  • Nichol AJ (1934) The influence of marginal buyers on monopolistic competition. Quart. J. Econom. 49(1):121–135.CrossrefGoogle Scholar
  • Robbins H (1952) Some aspects of the sequential design of experiments. Bull. Amer. Math. Soc. (N.S.) 58(5):527–535.CrossrefGoogle Scholar
  • Rusmevichientong P, Tsitsiklis JN (2010) Linearly parameterized bandits. Math. Oper. Res. 35(2):395–411.LinkGoogle Scholar
  • Slivkins A (2019) Introduction to multi-armed bandits. Preprint, submitted April 15, http://arxiv.org/abs/1904.07272.Google Scholar
  • Thompson WR (1933) On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika 25(3-4):285–294.CrossrefGoogle 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.