IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2402.14269.html
   My bibliography  Save this paper

Optimal Mechanism in a Dynamic Stochastic Knapsack Environment

Author

Listed:
  • Jihyeok Jung
  • Chan-Oi Song
  • Deok-Joo Lee
  • Kiho Yoon

Abstract

This study introduces an optimal mechanism in a dynamic stochastic knapsack environment. The model features a single seller who has a fixed quantity of a perfectly divisible item. Impatient buyers with a piece-wise linear utility function arrive randomly and they report the two-dimensional private information: marginal value and demanded quantity. We derive a revenue-maximizing dynamic mechanism in a finite discrete time framework that satisfies incentive compatibility, individual rationality, and feasibility conditions. It is achieved by characterizing buyers' utility and deriving the Bellman equation. Moreover, we propose the essential penalty scheme for incentive compatibility, as well as the allocation and payment policies. Lastly, we propose algorithms to approximate the optimal policy, based on the Monte Carlo simulation-based regression method and reinforcement learning.

Suggested Citation

  • Jihyeok Jung & Chan-Oi Song & Deok-Joo Lee & Kiho Yoon, 2024. "Optimal Mechanism in a Dynamic Stochastic Knapsack Environment," Papers 2402.14269, arXiv.org.
    • Handle: RePEc:arx:papers:2402.14269
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2402.14269
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sham M. Kakade & Ilan Lobel & Hamid Nazerzadeh, 2013. "Optimal Dynamic Mechanism Design and the Virtual-Pivot Mechanism," Operations Research, INFORMS, vol. 61(4), pages 837-854, August.
    2. Anton J. Kleywegt & Jason D. Papastavrou, 2001. "The Dynamic and Stochastic Knapsack Problem with Random Sized Items," Operations Research, INFORMS, vol. 49(1), pages 26-41, February.
    3. Yeon-Koo Che, 1993. "Design Competition through Multidimensional Auctions," RAND Journal of Economics, The RAND Corporation, vol. 24(4), pages 668-680, Winter.
    4. , & , & ,, 2011. "Revenue maximization in the dynamic knapsack problem," Theoretical Economics, Econometric Society, vol. 6(2), May.
    5. Alex Gershkov & Benny Moldovanu, 2009. "Dynamic Revenue Maximization with Heterogeneous Objects: A Mechanism Design Approach," American Economic Journal: Microeconomics, American Economic Association, vol. 1(2), pages 168-198, August.
    6. John Asker & Estelle Cantillon, 2010. "Procurement when price and quality matter," RAND Journal of Economics, RAND Corporation, vol. 41(1), pages 1-34, March.
    7. Anton J. Kleywegt & Jason D. Papastavrou, 1998. "The Dynamic and Stochastic Knapsack Problem," Operations Research, INFORMS, vol. 46(1), pages 17-35, February.
    8. Dirk Bergemann & Juuso Välimäki, 2019. "Dynamic Mechanism Design: An Introduction," Journal of Economic Literature, American Economic Association, vol. 57(2), pages 235-274, June.
    9. Gustavo Vulcano & Garrett van Ryzin & Costis Maglaras, 2002. "Optimal Dynamic Auctions for Revenue Management," Management Science, INFORMS, vol. 48(11), pages 1388-1407, November.
    10. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    11. Alessandro Pavan & Ilya Segal & Juuso Toikka, 2014. "Dynamic Mechanism Design: A Myersonian Approach," Econometrica, Econometric Society, vol. 82(2), pages 601-653, March.
    12. Garud Iyengar & Anuj Kumar, 2008. "Optimal procurement mechanisms for divisible goods with capacitated suppliers," Review of Economic Design, Springer;Society for Economic Design, vol. 12(2), pages 129-154, June.
    13. Mallesh M. Pai & Rakesh Vohra, 2013. "Optimal Dynamic Auctions and Simple Index Rules," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 682-697, November.
    14. Jason D. Papastavrou & Srikanth Rajagopalan & Anton J. Kleywegt, 1996. "The Dynamic and Stochastic Knapsack Problem with Deadlines," Management Science, INFORMS, vol. 42(12), pages 1706-1718, 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. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.
    2. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    3. Tao Zhang & Quanyan Zhu, 2019. "On Incentive Compatibility in Dynamic Mechanism Design With Exit Option in a Markovian Environment," Papers 1909.13720, arXiv.org, revised May 2021.
    4. Tao Zhang & Quanyan Zhu, 2022. "On Incentive Compatibility in Dynamic Mechanism Design With Exit Option in a Markovian Environment," Dynamic Games and Applications, Springer, vol. 12(2), pages 701-745, June.
    5. Mallesh M. Pai & Rakesh Vohra, 2013. "Optimal Dynamic Auctions and Simple Index Rules," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 682-697, November.
    6. , & , & ,, 2011. "Revenue maximization in the dynamic knapsack problem," Theoretical Economics, Econometric Society, vol. 6(2), May.
    7. Vahab Mirrokni & Renato Paes Leme & Pingzhong Tang & Song Zuo, 2020. "Non‐Clairvoyant Dynamic Mechanism Design," Econometrica, Econometric Society, vol. 88(5), pages 1939-1963, September.
    8. Vahab Mirrokni & Renato Paes Leme & Pingzhong Tang & Song Zuo, 2018. "Optimal Dynamic Auctions are Virtual Welfare Maximizers," Papers 1812.02993, arXiv.org.
    9. Kiho Yoon, 2021. "When to sell an indivisible object: Optimal timing with Markovian buyers," Papers 2105.07649, arXiv.org, revised Aug 2024.
    10. Yonatan Gur & Gregory Macnamara & Daniela Saban, 2022. "Sequential Procurement with Contractual and Experimental Learning," Management Science, INFORMS, vol. 68(4), pages 2714-2731, April.
    11. Jung, Jihyeok & Song, Chan-Oi & Lee, Deok-Joo & Yoon, Kiho, 2024. "Optimal energy procurement with long-term photovoltaic energy contracts considering generation uncertainty: A two-dimensional auction approach," Applied Energy, Elsevier, vol. 356(C).
    12. Hinnosaar, Toomas, 2017. "Calendar mechanisms," Games and Economic Behavior, Elsevier, vol. 104(C), pages 252-270.
    13. Yiwei Chen & Vivek F. Farias, 2018. "Robust Dynamic Pricing with Strategic Customers," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1119-1142, November.
    14. Santiago R. Balseiro & Vahab S. Mirrokni & Renato Paes Leme, 2018. "Dynamic Mechanisms with Martingale Utilities," Management Science, INFORMS, vol. 64(11), pages 5062-5082, November.
    15. Sham M. Kakade & Ilan Lobel & Hamid Nazerzadeh, 2013. "Optimal Dynamic Mechanism Design and the Virtual-Pivot Mechanism," Operations Research, INFORMS, vol. 61(4), pages 837-854, August.
    16. Bergemann, Dirk & Pavan, Alessandro, 2015. "Introduction to Symposium on Dynamic Contracts and Mechanism Design," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 679-701.
    17. Santiago R. Balseiro & Omar Besbes & Gabriel Y. Weintraub, 2019. "Dynamic Mechanism Design with Budget-Constrained Buyers Under Limited Commitment," Operations Research, INFORMS, vol. 67(3), pages 711-730, May.
    18. Alex Gershkov & Benny Moldovanu & Philipp Strack, 2018. "Revenue-Maximizing Mechanisms with Strategic Customers and Unknown, Markovian Demand," Management Science, INFORMS, vol. 64(5), pages 2031-2046, May.
    19. Dinard van der Laan & Zaifu Yang, 2019. "Efficient Sequential Assignments with Randomly Arriving Multi-Item Demand Agents," Discussion Papers 19/13, Department of Economics, University of York.
    20. Jiao, Wen & Yan, Hong & Pang, King-Wah, 2016. "Nonlinear pricing for stochastic container leasing system," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 1-18.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:arx:papers:2402.14269. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.