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

Dynamic Mechanisms with Martingale Utilities

Author

Listed:
  • Santiago R. Balseiro

    (Graduate School of Business, Columbia University, New York, New York 10027)

  • Vahab S. Mirrokni

    (Google Research, New York, New York 10011)

  • Renato Paes Leme

    (Google Research, New York, New York 10011)

Abstract

We study the dynamic mechanism design problem of a seller who repeatedly sells independent items to a buyer with private values. In this setting, the seller could potentially extract the entire buyer surplus by running efficient auctions and charging an upfront participation fee at the beginning of the horizon. In some markets, such as Internet advertising, participation fees are not practical since buyers expect to inspect items before purchasing them. This motivates us to study the design of dynamic mechanisms under successively more stringent requirements that capture the implicit business constraints of these markets. We first consider a periodic individual rationality constraint , which limits the mechanism to charge at most the buyer’s value in each period. While this prevents large upfront participation fees, the seller can still design mechanisms that spread a participation fee across multiple initial auctions. These mechanisms have the unappealing feature that they provide close-to-zero buyer utility in earlier auctions in exchange for higher utility in later auctions. To address this problem, we introduce a martingale utility constraint , which imposes the requirement that from the perspective of the buyer, the next item’s expected utility is equal to the present one’s. Our main result is providing a dynamic auction satisfying martingale utility and periodic individual rationality whose loss in profit with respect to first-best (full extraction of buyer surplus) is optimal up to polylogarithmic factors. The proposed mechanism is a dynamic two-tier auction with a hard floor and a soft floor that allocates the item whenever the buyer’s bid is above the hard floor and charges the minimum of the bid and the soft floor.

Suggested Citation

  • 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.
  • Handle: RePEc:inm:ormnsc:v:64:y:2018:i:11:p:5062-5082
    DOI: 10.1287/mnsc.2017.2872
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/mnsc.2017.2872
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.2017.2872?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. Hart, Sergiu & Nisan, Noam, 2017. "Approximate revenue maximization with multiple items," Journal of Economic Theory, Elsevier, vol. 172(C), pages 313-347.
    2. Besanko, David, 1985. "Multi-period contracts between principal and agent with adverse selection," Economics Letters, Elsevier, vol. 17(1-2), pages 33-37.
    3. Bruno Biais & Thomas Mariotti & Guillaume Plantin & Jean-Charles Rochet, 2007. "Dynamic Security Design: Convergence to Continuous Time and Asset Pricing Implications," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 74(2), pages 345-390.
    4. Daniel Krähmer & Roland Strausz, 2015. "Optimal Sales Contracts with Withdrawal Rights," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 82(2), pages 762-790.
    5. Manelli, Alejandro M. & Vincent, Daniel R., 2006. "Bundling as an optimal selling mechanism for a multiple-good monopolist," Journal of Economic Theory, Elsevier, vol. 127(1), pages 1-35, March.
    6. Deb, Rahul & Said, Maher, 2015. "Dynamic screening with limited commitment," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 891-928.
    7. Thomas, Jonathan & Worrall, Tim, 1990. "Income fluctuation and asymmetric information: An example of a repeated principal-agent problem," Journal of Economic Theory, Elsevier, vol. 51(2), pages 367-390, August.
    8. Martin A. Lariviere & Evan L. Porteus, 2001. "Selling to the Newsvendor: An Analysis of Price-Only Contracts," Manufacturing & Service Operations Management, INFORMS, vol. 3(4), pages 293-305, May.
    9. 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.
    10. Stephen E. Spear & Sanjay Srivastava, 1987. "On Repeated Moral Hazard with Discounting," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 54(4), pages 599-617.
    11. Jérémie Gallien, 2006. "Dynamic Mechanism Design for Online Commerce," Operations Research, INFORMS, vol. 54(2), pages 291-310, April.
    12. Simon Board & Andrzej Skrzypacz, 2016. "Revenue Management with Forward-Looking Buyers," Journal of Political Economy, University of Chicago Press, vol. 124(4), pages 1046-1087.
    13. R. Vijay Krishna & Giuseppe Lopomo & Curtis R. Taylor, 2013. "Stairway to heaven or highway to hell: Liquidity, sweat equity, and the uncertain path to ownership," RAND Journal of Economics, RAND Corporation, vol. 44(1), pages 104-127, March.
    14. Gustavo Vulcano & Garrett van Ryzin & Costis Maglaras, 2002. "Optimal Dynamic Auctions for Revenue Management," Management Science, INFORMS, vol. 48(11), pages 1388-1407, November.
    15. Matthew O Jackson & Hugo F Sonnenschein, 2007. "Overcoming Incentive Constraints by Linking Decisions -super-1," Econometrica, Econometric Society, vol. 75(1), pages 241-257, January.
    16. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    17. Alessandro Pavan & Ilya Segal & Juuso Toikka, 2014. "Dynamic Mechanism Design: A Myersonian Approach," Econometrica, Econometric Society, vol. 82(2), pages 601-653, March.
    18. Akan, Mustafa & Ata, Barış & Dana, James D., 2015. "Revenue management by sequential screening," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 728-774.
    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. Bergemann, Dirk & Castro, Francisco & Weintraub, Gabriel Y., 2020. "The scope of sequential screening with ex post participation constraints," Journal of Economic Theory, Elsevier, vol. 188(C).
    2. Yash Kanoria & Hamid Nazerzadeh, 2021. "Incentive-Compatible Learning of Reserve Prices for Repeated Auctions," Operations Research, INFORMS, vol. 69(2), pages 509-524, March.
    3. Hemang Subramanian & Sabyasachi Mitra & Sam Ransbotham, 2021. "Capturing Value in Platform Business Models That Rely on User-Generated Content," Organization Science, INFORMS, vol. 32(3), pages 804-823, 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. 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.
    2. 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.
    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. Dirk Bergemann & Alessandro Pavan, 2015. "Introduction to JET Symposium Issue on "Dynamic Contracts and Mechanism Design"," Cowles Foundation Discussion Papers 2016, Cowles Foundation for Research in Economics, Yale University.
    6. 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.
    7. Rohit Lamba & Ilia Krasikov, 2017. "A Theory of Dynamic Contracting with Financial Constraints," 2017 Meeting Papers 1544, Society for Economic Dynamics.
    8. Negin Golrezaei & Hamid Nazerzadeh & Ramandeep Randhawa, 2020. "Dynamic Pricing for Heterogeneous Time-Sensitive Customers," Manufacturing & Service Operations Management, INFORMS, vol. 22(3), pages 562-581, May.
    9. Daniel Krähmer & Roland Strausz, 2024. "Dynamic Screening with Verifiable Bankruptcy," CRC TR 224 Discussion Paper Series crctr224_2024_525, University of Bonn and University of Mannheim, Germany.
    10. Bergemann, Dirk & V�lim�ki, Juuso, 2017. "Dynamic Mechanism Design: An Introduction," CEPR Discussion Papers 12240, C.E.P.R. Discussion Papers.
    11. Krähmer, Daniel & Strausz, Roland, 2022. "Dynamic Screening with Verifiable Bankruptcy," Rationality and Competition Discussion Paper Series 348, CRC TRR 190 Rationality and Competition.
    12. Krasikov, Ilia & Lamba, Rohit, 2021. "A theory of dynamic contracting with financial constraints," Journal of Economic Theory, Elsevier, vol. 193(C).
    13. 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.
    14. Bergemann, Dirk & Strack, Philipp, 2022. "Progressive participation," Theoretical Economics, Econometric Society, vol. 17(3), July.
    15. Golosov, M. & Tsyvinski, A. & Werquin, N., 2016. "Recursive Contracts and Endogenously Incomplete Markets," Handbook of Macroeconomics, in: J. B. Taylor & Harald Uhlig (ed.), Handbook of Macroeconomics, edition 1, volume 2, chapter 0, pages 725-841, Elsevier.
    16. Yiwei Chen & Vivek F. Farias, 2018. "Robust Dynamic Pricing with Strategic Customers," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1119-1142, November.
    17. 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.
    18. Garrett, Daniel F., 2017. "Dynamic mechanism design: Dynamic arrivals and changing values," Games and Economic Behavior, Elsevier, vol. 104(C), pages 595-612.
    19. 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.
    20. Arve, Malin & Zwart, Gijsbert, 2023. "Optimal procurement and investment in new technologies under uncertainty," Journal of Economic Dynamics and Control, Elsevier, vol. 147(C).

    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:64:y:2018:i:11:p:5062-5082. 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.