IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v69y2021i3p821-840.html
   My bibliography  Save this article

Online Allocation and Pricing: Constant Regret via Bellman Inequalities

Author

Listed:
  • Alberto Vera

    (School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853)

  • Siddhartha Banerjee

    (School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853)

  • Itai Gurvich

    (Kellogg School of Management, Northwestern University, Evanston, Illinois 60208)

Abstract

We develop a framework for designing simple and efficient policies for a family of online allocation and pricing problems that includes online packing, budget-constrained probing, dynamic pricing, and online contextual bandits with knapsacks. In each case, we evaluate the performance of our policies in terms of their regret (i.e., additive gap) relative to an offline controller that is endowed with more information than the online controller. Our framework is based on Bellman inequalities, which decompose the loss of an algorithm into two distinct sources of error: (1) arising from computational tractability issues, and (2) arising from estimation/prediction of random trajectories. Balancing these errors guides the choice of benchmarks, and leads to policies that are both tractable and have strong performance guarantees. In particular, in all our examples, we demonstrate constant-regret policies that only require resolving a linear program in each period, followed by a simple greedy action-selection rule; thus, our policies are practical as well as provably near optimal.

Suggested Citation

  • Alberto Vera & Siddhartha Banerjee & Itai Gurvich, 2021. "Online Allocation and Pricing: Constant Regret via Bellman Inequalities," Operations Research, INFORMS, vol. 69(3), pages 821-840, May.
    • Handle: RePEc:inm:oropre:v:69:y:2021:i:3:p:821-840
    DOI: 10.1287/opre.2020.2061
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2020.2061
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2020.2061?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. Guillermo Gallego & Garrett van Ryzin, 1997. "A Multiproduct Dynamic Pricing Problem and Its Applications to Network Yield Management," Operations Research, INFORMS, vol. 45(1), pages 24-41, February.
    2. Santiago R. Balseiro & David B. Brown, 2019. "Approximations to Stochastic Dynamic Programs via Information Relaxation Duality," Operations Research, INFORMS, vol. 67(2), pages 577-597, March.
    3. Niv Buchbinder & Kamal Jain & Mohit Singh, 2014. "Secretary Problems via Linear Programming," Mathematics of Operations Research, INFORMS, vol. 39(1), pages 190-206, February.
    4. Weitzman, Martin L, 1979. "Optimal Search for the Best Alternative," Econometrica, Econometric Society, vol. 47(3), pages 641-654, May.
    5. Qi (George) Chen & Stefanus Jasin & Izak Duenyas, 2019. "Nonparametric Self-Adjusting Control for Joint Learning and Optimization of Multiproduct Pricing with Finite Resource Capacity," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 601-631, May.
    6. Stefanus Jasin, 2014. "Reoptimization and Self-Adjusting Price Control for Network Revenue Management," Operations Research, INFORMS, vol. 62(5), pages 1168-1178, October.
    7. David B. Brown & James E. Smith & Peng Sun, 2010. "Information Relaxations and Duality in Stochastic Dynamic Programs," Operations Research, INFORMS, vol. 58(4-part-1), pages 785-801, August.
    8. Stefanus Jasin & Sunil Kumar, 2012. "A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 313-345, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Süleyman Kerimov & Itai Ashlagi & Itai Gurvich, 2024. "Dynamic Matching: Characterizing and Achieving Constant Regret," Management Science, INFORMS, vol. 70(5), pages 2799-2822, May.

    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. Qi (George) Chen & Stefanus Jasin & Izak Duenyas, 2016. "Real-Time Dynamic Pricing with Minimal and Flexible Price Adjustment," Management Science, INFORMS, vol. 62(8), pages 2437-2455, August.
    2. Xiangyu Gao & Stefanus Jasin & Sajjad Najafi & Huanan Zhang, 2022. "Joint Learning and Optimization for Multi-Product Pricing (and Ranking) Under a General Cascade Click Model," Management Science, INFORMS, vol. 68(10), pages 7362-7382, October.
    3. Stefanus Jasin & Amitabh Sinha, 2015. "An LP-Based Correlated Rounding Scheme for Multi-Item Ecommerce Order Fulfillment," Operations Research, INFORMS, vol. 63(6), pages 1336-1351, December.
    4. Yanzhe (Murray) Lei & Stefanus Jasin & Amitabh Sinha, 2018. "Joint Dynamic Pricing and Order Fulfillment for E-commerce Retailers," Manufacturing & Service Operations Management, INFORMS, vol. 20(2), pages 269-284, May.
    5. Yanzhe (Murray) Lei & Stefanus Jasin, 2020. "Real-Time Dynamic Pricing for Revenue Management with Reusable Resources, Advance Reservation, and Deterministic Service Time Requirements," Operations Research, INFORMS, vol. 68(3), pages 676-685, May.
    6. Yiwei Chen & Cong Shi, 2023. "Network revenue management with online inverse batch gradient descent method," Production and Operations Management, Production and Operations Management Society, vol. 32(7), pages 2123-2137, July.
    7. Hyun-Soo Ahn & Stefanus Jasin & Philip Kaminsky & Yang Wang, 2018. "Analysis of Deterministic Control and Its Improvements for an Inventory Problem with Multiproduct Batch Differentiation," Operations Research, INFORMS, vol. 66(1), pages 58-78, 1-2.
    8. Yongbo Xiao, 2018. "Dynamic pricing and replenishment: Optimality, bounds, and asymptotics," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(1), pages 3-25, February.
    9. Pornpawee Bumpensanti & He Wang, 2020. "A Re-Solving Heuristic with Uniformly Bounded Loss for Network Revenue Management," Management Science, INFORMS, vol. 66(7), pages 2993-3009, July.
    10. Yiwei Chen & Nikolaos Trichakis, 2021. "Technical Note—On Revenue Management with Strategic Customers Choosing When and What to Buy," Operations Research, INFORMS, vol. 69(1), pages 175-187, January.
    11. Qi (George) Chen & Stefanus Jasin & Izak Duenyas, 2021. "Technical Note—Joint Learning and Optimization of Multi-Product Pricing with Finite Resource Capacity and Unknown Demand Parameters," Operations Research, INFORMS, vol. 69(2), pages 560-573, March.
    12. Stefanus Jasin, 2014. "Reoptimization and Self-Adjusting Price Control for Network Revenue Management," Operations Research, INFORMS, vol. 62(5), pages 1168-1178, October.
    13. Steven Kou & Xianhua Peng & Xingbo Xu, 2016. "EM Algorithm and Stochastic Control in Economics," Papers 1611.01767, arXiv.org.
    14. Santiago R. Balseiro & David B. Brown, 2019. "Approximations to Stochastic Dynamic Programs via Information Relaxation Duality," Operations Research, INFORMS, vol. 67(2), pages 577-597, March.
    15. Daniel R. Jiang & Lina Al-Kanj & Warren B. Powell, 2020. "Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds," Operations Research, INFORMS, vol. 68(6), pages 1678-1697, November.
    16. Qi (George) Chen & Stefanus Jasin & Izak Duenyas, 2019. "Nonparametric Self-Adjusting Control for Joint Learning and Optimization of Multiproduct Pricing with Finite Resource Capacity," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 601-631, May.
    17. Zhou, Yong-Wu & Zhang, Xiong & Zhong, Yuanguang & Cao, Bin & Cheng, T.C. Edwin, 2021. "Dynamic pricing and cross-channel fulfillment for omnichannel retailing industry: An approximation policy and implications," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    18. Dragos Florin Ciocan & Vivek Farias, 2012. "Model Predictive Control for Dynamic Resource Allocation," Mathematics of Operations Research, INFORMS, vol. 37(3), pages 501-525, August.
    19. Dragos Florin Ciocan & Krishnamurthy Iyer, 2021. "Tractable Equilibria in Sponsored Search with Endogenous Budgets," Operations Research, INFORMS, vol. 69(1), pages 227-244, January.
    20. Alessio Trivella & Danial Mohseni-Taheri & Selvaprabu Nadarajah, 2023. "Meeting Corporate Renewable Power Targets," Management Science, INFORMS, vol. 69(1), pages 491-512, January.

    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:oropre:v:69:y:2021:i:3:p:821-840. 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.