Revenue in Truly Combinatorial Auctions and Adversarial Mechanism Design
Author(s)
Micali, Silvio; Valiant, Paul
DownloadMIT-CSAIL-TR-2008-039.pdf (326.2Kb)
Additional downloads
Other Contributors
Theory of Computation
Advisor
Silvio Micali
Metadata
Show full item recordAbstract
Little is known about generating revenue in UNRESTRICTED combinatorial auctions. (In particular, the VCG mechanism has no revenue guarantees.) In this paper we determine how much revenue can be guaranteed in such auctions. Our analysis holds both in the standard model, when all players are independent and rational, as well as in a most adversarial model, where some players may bid collusively or even totally irrationally.
Date issued
2007- 11-0Other identifiers
MIT-CSAIL-TR-2008-039
Keywords
Revenue Benchmarks, Revenue lowerbounds, revenue upperbounds, Probabilistic DST mechanisms