IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v130y2021icp465-473.html
   My bibliography  Save this article

Dynamic slot allocations with different patience levels

Author

Listed:
  • Sano, Ryuji

Abstract

This study considers a mechanism design problem in which service slots are allocated over time to buyers arriving in different periods. Buyers have a multidimensional type representing their valuation and patience level. Some buyers can accept delayed service, whereas others cannot. The seller fully commits to a deterministic mechanism. We show that a mechanism is periodic ex-post incentive compatible if and only if the allocation rule is monotone in valuation and “price equivalence” holds. The dynamic pivot mechanism with reserve prices maximizes the seller's expected revenue if and only if the virtual valuation function is affine.

Suggested Citation

  • Sano, Ryuji, 2021. "Dynamic slot allocations with different patience levels," Games and Economic Behavior, Elsevier, vol. 130(C), pages 465-473.
    • Handle: RePEc:eee:gamebe:v:130:y:2021:i:c:p:465-473
    DOI: 10.1016/j.geb.2021.09.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825621001287
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2021.09.006?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Pavlov Gregory, 2011. "Optimal Mechanism for Selling Two Goods," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 11(1), pages 1-35, February.
    2. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.
    3. Dirk Bergemann & Juuso V‰lim‰ki, 2010. "The Dynamic Pivot Mechanism," Econometrica, Econometric Society, vol. 78(2), pages 771-789, March.
    4. , & ,, 2013. "Implementation in multidimensional dichotomous domains," Theoretical Economics, Econometric Society, vol. 8(2), May.
    5. Thanassoulis, John, 2004. "Haggling over substitutes," Journal of Economic Theory, Elsevier, vol. 117(2), pages 217-245, August.
    6. Yi‐Chun Chen & Wei He & Jiangtao Li & Yeneng Sun, 2019. "Equivalence of Stochastic and Deterministic Mechanisms," Econometrica, Econometric Society, vol. 87(4), pages 1367-1390, July.
    7. Hinnosaar, Toomas, 2017. "Calendar mechanisms," Games and Economic Behavior, Elsevier, vol. 104(C), pages 252-270.
    8. Said, Maher, 2012. "Auctions with dynamic populations: Efficiency and revenue maximization," Journal of Economic Theory, Elsevier, vol. 147(6), pages 2419-2438.
    9. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    10. 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.
    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. Hinnosaar, Toomas, 2017. "Calendar mechanisms," Games and Economic Behavior, Elsevier, vol. 104(C), pages 252-270.
    2. Jeffrey C. Ely & Daniel F. Garrett & Toomas Hinnosaar, 2017. "Overbooking," Journal of the European Economic Association, European Economic Association, vol. 15(6), pages 1258-1301.
    3. Bikhchandani, Sushil & Mishra, Debasis, 2022. "Selling two identical objects," Journal of Economic Theory, Elsevier, vol. 200(C).
    4. 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.
    5. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    6. 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.
    7. 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.
    8. 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.
    9. Pavlov Gregory, 2011. "A Property of Solutions to Linear Monopoly Problems," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 11(1), pages 1-18, February.
    10. Sergiu Hart & Noam Nisan, 2013. "Selling Multiple Correlated Goods: Revenue Maximization and Menu-Size Complexity (old title: "The Menu-Size Complexity of Auctions")," Papers 1304.6116, arXiv.org, revised Nov 2018.
    11. Cai, Yang & Daskalakis, Constantinos, 2015. "Extreme value theorems for optimal multidimensional pricing," Games and Economic Behavior, Elsevier, vol. 92(C), pages 266-305.
    12. Emil Temnyalov, 2019. "Points mechanisms and rewards programs," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 28(3), pages 436-457, June.
    13. Hart, Sergiu & Nisan, Noam, 2017. "Approximate revenue maximization with multiple items," Journal of Economic Theory, Elsevier, vol. 172(C), pages 313-347.
    14. Alon Eden & Michal Feldman & Ophir Friedler & Inbal Talgam-Cohen & S. Matthew Weinberg, 2021. "A Simple and Approximately Optimal Mechanism for a Buyer with Complements," Operations Research, INFORMS, vol. 69(1), pages 188-206, January.
    15. Anderson, Simon P. & Celik, Levent, 2020. "Opaque selling," Information Economics and Policy, Elsevier, vol. 52(C).
    16. Constantinos Daskalakis & Maxwell Fishelson & Brendan Lucier & Vasilis Syrgkanis & Santhoshini Velusamy, 2020. "Multi-item Non-truthful Auctions Achieve Good Revenue," Papers 2002.06702, arXiv.org, revised Sep 2022.
    17. Devanur, Nikhil R. & Haghpanah, Nima & Psomas, Alexandros, 2020. "Optimal multi-unit mechanisms with private demands," Games and Economic Behavior, Elsevier, vol. 121(C), pages 482-505.
    18. Tang, Pingzhong & Wang, Zihe, 2017. "Optimal mechanisms with simple menus," Journal of Mathematical Economics, Elsevier, vol. 69(C), pages 54-70.
    19. Deb, Rahul & Said, Maher, 2015. "Dynamic screening with limited commitment," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 891-928.
    20. Thomas D. Jeitschko & Pallavi Pal, 2021. "Curbing Price Fluctuations in Cap-and-Trade Auctions," CESifo Working Paper Series 9266, CESifo.

    More about this item

    Keywords

    Dynamic mechanism design; Patience; Optimal mechanism; Multidimensional type;
    All these keywords.

    JEL classification:

    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions

    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:eee:gamebe:v:130:y:2021:i:c:p:465-473. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    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.