IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v60y2014i3p770-783.html
   My bibliography  Save this article

Simultaneously Learning and Optimizing Using Controlled Variance Pricing

Author

Listed:
  • Arnoud V. den Boer

    (Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands; and University of Amsterdam, 1098 XH Amsterdam, The Netherlands)

  • Bert Zwart

    (Centrum Wiskunde and Informatica, 1098 XG Amsterdam, The Netherlands; and Department of Mathematics, VU University Amsterdam, 1081 HV Amsterdam, The Netherlands)

Abstract

Price experimentation is an important tool for firms to find the optimal selling price of their products. It should be conducted properly, since experimenting with selling prices can be costly. A firm, therefore, needs to find a pricing policy that optimally balances between learning the optimal price and gaining revenue. In this paper, we propose such a pricing policy, called controlled variance pricing (CVP). The key idea of the policy is to enhance the certainty equivalent pricing policy with a taboo interval around the average of previously chosen prices. The width of the taboo interval shrinks at an appropriate rate as the amount of data gathered gets large; this guarantees sufficient price dispersion. For a large class of demand models, we show that this procedure is strongly consistent, which means that eventually the value of the optimal price will be learned, and derive upper bounds on the regret, which is the expected amount of money lost due to not using the optimal price. Numerical tests indicate that CVP performs well on different demand models and time scales. This paper was accepted by Assaf Zeevi, stochastic models and simulation.

Suggested Citation

  • Arnoud V. den Boer & Bert Zwart, 2014. "Simultaneously Learning and Optimizing Using Controlled Variance Pricing," Management Science, INFORMS, vol. 60(3), pages 770-783, March.
  • Handle: RePEc:inm:ormnsc:v:60:y:2014:i:3:p:770-783
    DOI: 10.1287/mnsc.2013.1788
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2013.1788
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.2013.1788?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Godfrey Keller & Sven Rady, 1999. "Optimal Experimentation in a Changing Environment," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 66(3), pages 475-507.
    2. Philippe Aghion & Patrick Bolton & Christopher Harris & Bruno Jullien, 1991. "Optimal Learning by Experimentation," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 58(4), pages 621-654.
    3. Lai, T. L. & Robbins, Herbert & Wei, C. Z., 1979. "Strong consistency of least squares estimates in multiple regression II," Journal of Multivariate Analysis, Elsevier, vol. 9(3), pages 343-361, September.
    4. Vivek F. Farias & Benjamin Van Roy, 2010. "Dynamic Pricing with a Prior on Market Response," Operations Research, INFORMS, vol. 58(1), pages 16-29, February.
    5. Andrew E. B. Lim & J. George Shanthikumar, 2007. "Relative Entropy, Exponential Utility, and Robust Dynamic Pricing," Operations Research, INFORMS, vol. 55(2), pages 198-214, April.
    6. J. Michael Harrison & N. Bora Keskin & Assaf Zeevi, 2012. "Bayesian Dynamic Pricing Policies: Learning and Earning Under a Binary Prior Distribution," Management Science, INFORMS, vol. 58(3), pages 570-586, March.
    7. Eric Cope, 2007. "Bayesian strategies for dynamic pricing in e‐commerce," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(3), pages 265-281, April.
    8. Balvers, Ronald J & Cosimano, Thomas F, 1990. "Actively Learning about Demand and the Dynamics of Price Adjustment," Economic Journal, Royal Economic Society, vol. 100(402), pages 882-898, September.
    9. Victor F. Araman & René Caldentey, 2009. "Dynamic Pricing for Nonperishable Products with Demand Learning," Operations Research, INFORMS, vol. 57(5), pages 1169-1188, October.
    10. Lin, Kyle Y., 2006. "Dynamic pricing with real-time demand learning," European Journal of Operational Research, Elsevier, vol. 174(1), pages 522-538, October.
    11. McLennan, Andrew, 1984. "Price dispersion and incomplete learning in the long run," Journal of Economic Dynamics and Control, Elsevier, vol. 7(3), pages 331-347, September.
    12. Kiefer, Nicholas M & Nyarko, Yaw, 1989. "Optimal Control of an Unknown Linear Process with Learning," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 30(3), pages 571-586, August.
    13. Omar Besbes & Assaf Zeevi, 2011. "On the Minimax Complexity of Pricing in a Changing Environment," Operations Research, INFORMS, vol. 59(1), pages 66-79, February.
    14. Josef Broder & Paat Rusmevichientong, 2012. "Dynamic Pricing Under a General Parametric Choice Model," Operations Research, INFORMS, vol. 60(4), pages 965-980, August.
    15. Anderson, T W & Taylor, John B, 1976. "Some Experimental Results on the Statistical Properties of Least Squares Estimates in Control Problems," Econometrica, Econometric Society, vol. 44(6), pages 1289-1302, November.
    16. Taylor, John B, 1974. "Asymptotic Properties of Multiperiod Control Rules in the Linear Regression Model," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 15(2), pages 472-484, June.
    17. Omar Besbes & Assaf Zeevi, 2009. "Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms," Operations Research, INFORMS, vol. 57(6), pages 1407-1420, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. den Boer, Arnoud V., 2015. "Tracking the market: Dynamic pricing and learning in a changing environment," European Journal of Operational Research, Elsevier, vol. 247(3), pages 914-927.
    2. N. Bora Keskin & Assaf Zeevi, 2017. "Chasing Demand: Learning and Earning in a Changing Environment," Mathematics of Operations Research, INFORMS, vol. 42(2), pages 277-307, May.
    3. Arnoud V. den Boer, 2014. "Dynamic Pricing with Multiple Products and Partially Specified Demand Distribution," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 863-888, August.
    4. Xiao, Baichun & Yang, Wei, 2021. "A Bayesian learning model for estimating unknown demand parameter in revenue management," European Journal of Operational Research, Elsevier, vol. 293(1), pages 248-262.
    5. Philipp Afèche & Barış Ata, 2013. "Bayesian Dynamic Pricing in Queueing Systems with Unknown Delay Cost Characteristics," Manufacturing & Service Operations Management, INFORMS, vol. 15(2), pages 292-304, May.
    6. Hao Zhang, 2022. "Analytical Solution to a Discrete-Time Model for Dynamic Learning and Decision Making," Management Science, INFORMS, vol. 68(8), pages 5924-5957, August.
    7. N. Bora Keskin & Assaf Zeevi, 2014. "Dynamic Pricing with an Unknown Demand Model: Asymptotically Optimal Semi-Myopic Policies," Operations Research, INFORMS, vol. 62(5), pages 1142-1167, October.
    8. Huashuai Qu & Ilya O. Ryzhov & Michael C. Fu & Eric Bergerson & Megan Kurka & Ludek Kopacek, 2020. "Learning Demand Curves in B2B Pricing: A New Framework and Case Study," Production and Operations Management, Production and Operations Management Society, vol. 29(5), pages 1287-1306, May.
    9. Wieland, Volker, 2000. "Learning by doing and the value of optimal experimentation," Journal of Economic Dynamics and Control, Elsevier, vol. 24(4), pages 501-534, April.
    10. J. Michael Harrison & N. Bora Keskin & Assaf Zeevi, 2012. "Bayesian Dynamic Pricing Policies: Learning and Earning Under a Binary Prior Distribution," Management Science, INFORMS, vol. 58(3), pages 570-586, March.
    11. Arnoud V. den Boer & N. Bora Keskin, 2020. "Discontinuous Demand Functions: Estimation and Pricing," Management Science, INFORMS, vol. 66(10), pages 4516-4534, October.
    12. Zizhuo Wang & Shiming Deng & Yinyu Ye, 2014. "Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems," Operations Research, INFORMS, vol. 62(2), pages 318-331, April.
    13. Athanassios N. Avramidis & Arnoud V. Boer, 2021. "Dynamic pricing with finite price sets: a non-parametric approach," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(1), pages 1-34, August.
    14. Athanassios N. Avramidis, 2020. "A pricing problem with unknown arrival rate and price sensitivity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(1), pages 77-106, August.
    15. Volker Wieland, "undated". "Monetary Policy and Uncertainty about the Natural Unemployment Rate," Computing in Economics and Finance 1997 11, Society for Computational Economics.
    16. Ruben Geer & Arnoud V. Boer & Christopher Bayliss & Christine S. M. Currie & Andria Ellina & Malte Esders & Alwin Haensel & Xiao Lei & Kyle D. S. Maclean & Antonio Martinez-Sykora & Asbjørn Nilsen Ris, 2019. "Dynamic pricing and learning with competition: insights from the dynamic pricing challenge at the 2017 INFORMS RM & pricing conference," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 18(3), pages 185-203, June.
    17. Maxime C. Cohen, & Georgia Perakis & Robert S. Pindyck, 2021. "A Simple Rule for Pricing with Limited Knowledge of Demand," Management Science, INFORMS, vol. 67(3), pages 1608-1621, March.
    18. Omar Besbes & Assaf Zeevi, 2012. "Blind Network Revenue Management," Operations Research, INFORMS, vol. 60(6), pages 1537-1550, December.
    19. Jue Wang, 2021. "Optimal Bayesian Demand Learning over Short Horizons," Production and Operations Management, Production and Operations Management Society, vol. 30(4), pages 1154-1177, April.
    20. Ruben van de Geer & Arnoud V. den Boer & Christopher Bayliss & Christine Currie & Andria Ellina & Malte Esders & Alwin Haensel & Xiao Lei & Kyle D. S. Maclean & Antonio Martinez-Sykora & Asbj{o}rn Nil, 2018. "Dynamic Pricing and Learning with Competition: Insights from the Dynamic Pricing Challenge at the 2017 INFORMS RM & Pricing Conference," Papers 1804.03219, arXiv.org.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:60:y:2014:i:3:p:770-783. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.