IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v24y2022i2p1165-1182.html
   My bibliography  Save this article

Online Learning and Optimization of (Some) Cyclic Pricing Policies in the Presence of Patient Customers

Author

Listed:
  • Huanan Zhang

    (Leeds School of Business, University of Colorado Boulder, Boulder, Colorado 80309)

  • Stefanus Jasin

    (Stephen M. Ross School of Business, University of Michigan, Ann Arbor, Michigan 48109)

Abstract

Problem definition : We consider the problem of joint learning and optimization of cyclic pricing policies in the presence of patient customers. In our problem, some customers are patient, and they are willing to wait in the system for several periods to make a purchase until the price is lower than their valuation. The seller does not know the joint distribution of customers’ valuation and patience level a priori and can only learn this from the realized total sales in every period. Academic/practical relevance : The revenue management problem with patient customers has been studied in the literature as an optimization problem, and cyclic policy has been shown to be optimal in some cases. We contribute to the literature by studying this problem from the joint learning and optimization perspective. Indeed, to the best of our knowledge, our paper is the first work that studies online learning and optimization for multiperiod pricing with patient customers. Methodology : We introduce new dynamic programming formulations for this problem, and we develop two nontrivial upper confidence bound–based learning algorithms. Results : We analyze both decreasing cyclic policies and so-called threshold-regulated policies, which contain both the decreasing cyclic policies and the nested decreasing cyclic policies. We show that our learning algorithms for these policies converge to the optimal clairvoyant decreasing cyclic policy and threshold-regulated policy at a near-optimal rate. Managerial implications : Our proposed algorithms perform significantly better than benchmark algorithms that either ignore the patient customer characteristic or simply use the standard estimate-then-optimize framework, which does not encourage enough exploration; this highlights the importance of “smart learning” in the context of data-driven decision making. In addition, our numerical results also show that combining our algorithms with smart estimation methods, such as linear interpolation or least square estimation, can significantly improve their empirical performance; this highlights the benefit of combining smart learning with smart estimation, which further increases the practical viability of the algorithms.

Suggested Citation

  • Huanan Zhang & Stefanus Jasin, 2022. "Online Learning and Optimization of (Some) Cyclic Pricing Policies in the Presence of Patient Customers," Manufacturing & Service Operations Management, INFORMS, vol. 24(2), pages 1165-1182, March.
  • Handle: RePEc:inm:ormsom:v:24:y:2022:i:2:p:1165-1182
    DOI: 10.1287/msom.2021.0979
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2021.0979
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2021.0979?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
    ---><---

    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:ormsom:v:24:y:2022:i:2:p:1165-1182. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.