A Dynamic Mechanism Design for Scheduling with Different Use Lengths

Ryuji Sano

No 924, KIER Working Papers from Kyoto University, Institute of Economic Research

Abstract: This paper considers a dynamic allocation problem in which many perishable goods are allocated at each period. Agents want to keep winning goods for more than one period to make profits. We consider efficient and optimal mechanisms when the seller offers simple long-term contracts. The dynamic VCG mechanism achieves efficient allocations. The expected revenue is maximized by the virtual welfare maximization. In the single unit case, price discounts for long-stay agents can be optimal under certain distributions. Both the efficient and optimal mechanisms are implemented by a simple “handicap auction†in the binary length case.

Keywords: dynamic mechanism design; online mechanism; optimal auction (search for similar items in EconPapers)
JEL-codes: C73 D44 D82 (search for similar items in EconPapers)
Pages: 32pages
Date: 2015-06
New Economics Papers: this item is included in nep-mic
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.kier.kyoto-u.ac.jp/DP/DP924.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:kyo:wpaper:924

Access Statistics for this paper

More papers in KIER Working Papers from Kyoto University, Institute of Economic Research Contact information at EDIRC.
Bibliographic data for series maintained by Makoto Watanabe (watanabe.makoto.2d@kyoto-u.ac.jp).