Name
Abstract | ||
|---|---|---|
Despite their better revenue and welfare guarantees for repeated auctions, dynamic mechanisms have not been widely adopted in practice. This is partly due to the complexity of their implementation as well as their unrealistic use of forecasting for future periods. We address these shortcomings and present a new family of dynamic mechanisms that are simple and require no distribution knowledge of future periods.
This paper introduces the concept of non-clairvoyance in dynamic mechanism design, which is a measure-theoretic restriction on the information that the seller can use. A dynamic mechanism is non-clairvoyant if the allocation and pricing rule at each period does not depend on the type distributions in future periods. We develop a framework (bank account mechanisms) for characterizing, designing, and proving lower bounds for dynamic mechanisms (clairvoyant or non-clairvoyant). This framework is used to characterize the revenue extraction power of non-clairvoyant mechanisms with respect to mechanisms that are allowed unrestricted use of distributional knowledge.
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.1145/3219166.3219224 | EC |
Keywords | Field | DocType |
Dynamic mechanism design,bank account mechanisms,non-clairvoyance,dynamic auctions,approximations,Internet advertising | Revenue,Mathematical optimization,Computer science,Online advertising,Common value auction,Mechanism design,Welfare | Conference |
ISBN | Citations | PageRank |
978-1-4503-5829-3 | 0 | 0.34 |
References | Authors | |
13 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| VAHAB S. MIRROKNI | 1 | 4309 | 287.14 |
| renato paes | 2 | 331 | 36.45 |
| Pingzhong Tang | 3 | 133 | 32.06 |
| Song Zuo | 4 | 29 | 13.06 |