Achieving budget-balance with vickrey-based payment schemes in exchanges (2001) [50 citations — 11 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Parkes01achievingbudget-balance,author = {David C. Parkes},
title = {Achieving budget-balance with vickrey-based payment schemes in exchanges},
booktitle = {In Seventeenth International Joint Conference on Artificial Intelligence},
year = {2001},
pages = {1161--1168}
}
Years of Citing Articles
Abstract:
Generalized Vickrey mechanisms have received wide attention in the literature because they are efficient and strategyproof, i.e. truthful bidding is optimal whatever the bids of other agents. However it is well-known that it is impossible for an exchange, with multiple buyers and sellers, to be efficient and budget-balanced, even putting strategy-proofness to one side. A market-maker in an efficient exchange must make more payments than it collects. We enforce budget-balance as a hard constraint, and explore payment rules to distribute surplus after an exchange clears to minimize distance to Vickrey payments. Different rules lead to different levels of truthrevelation and efficiency. Experimental and theoretical analysis suggest a simple Threshold scheme, which gives surplus to agents with payments further than a certain threshold value from their Vickrey payments. The scheme appears able to exploit agent uncertainty about bids from other agents to reduce manipulation and boost allocative efficiency in comparison with other simple rules.
Citations
| 598 | Counterspeculation, auctions, and competitive sealed tenders – Vickrey - 1961 |
| 364 | An algorithm for optimal winner determination in combinatorial auctions – Sandholm - 1999 |
| 258 | Computationally manageable combinatorial auctions – Rothkopf, Pekec, et al. - 1995 |
| 120 | Efficient Mechanisms for Bilateral Trading – Myerson, Satterthwaite - 1983 |
| 56 | Generalized Vickrey Auctions – Varian, MacKie-Mason - 1994 |
| 53 | Multipart pricing of public goods. Public Choice 2:19–33 – Clarke - 1971 |
| 38 | A dominant strategy double auction – McAfee - 1992 |
| 34 | Combinatorial auctions for supply chain formation – Walsh, Wellman, et al. - 2000 |
| 6 | Strategy-proof exchange,” Econometrica 63 – Barbera, Jackson - 1995 |
| 5 | Combinatorial auctions: A brief survey – Vries, Vohra - 2000 |
| 2 | Computational aspects of clearing continous double auctions with assignment constraints and indivisible demand – Kalagnanam, Davenport, et al. - 2000 |
