A Dynamic Mechanism Design with Overbooking, Different Deadlines, and Multi-unit Demands
This paper considers a dynamic mechanism design in which multiple objects with different consumption deadlines are allocated over time. Agents arrive over time and may have multi-unit demand. We characterize necessary and sufficient condition for periodic ex-post incentive compatibility and provide the optimal mechanism that maximizes the seller's expected revenue under regularity conditions. When complete contingent-contracts are available, the optimal mechanism can be interpreted as an "overbooking" mechanism. The seller utilizes overbooking for screening and price-discriminating advance agents. When agents demand multiple objects as complements, the seller may face a tradeoff between the last-minute price of the current object and the future profit.
|Date of creation:||Feb 2017|
|Contact details of provider:|| Postal: Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501|
Web page: http://www.kier.kyoto-u.ac.jp/eng/index.html
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Péter Eső & Balázs Szentes, 2007. "Optimal Information Disclosure in Auctions and the Handicap Auction," Review of Economic Studies, Oxford University Press, vol. 74(3), pages 705-731.
- 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.
- Said, Maher, 2012.
"Auctions with dynamic populations: Efficiency and revenue maximization,"
Journal of Economic Theory,
Elsevier, vol. 147(6), pages 2419-2438.
- Said, Maher, 2008. "Auctions with Dynamic Populations: Efficiency and Revenue Maximization," MPRA Paper 11456, University Library of Munich, Germany.
- Moldovanu, Benny & Dizdar, Deniz & Gershkov, Alex, 2011. "Revenue maximization in the dynamic knapsack problem," Theoretical Economics, Econometric Society, vol. 6(2), May.
- Deniz Dizdar & Alex Gershkov & Benny Moldovanu, 2010. "Revenue Maximization in the Dynamic Knapsack Problem," Discussion Paper Series dp544, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Alessandro Pavan & Ilya Segal & Juuso Toikka, 2014. "Dynamic Mechanism Design: A Myersonian Approach," Econometrica, Econometric Society, vol. 82(2), pages 601-653, March. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:kyo:wpaper:963. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ryo Okui)
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.