| dc.contributor.advisor | Silvio Micali | en_US |
| dc.contributor.author | Micali, Silvio | en_US |
| dc.contributor.author | Valiant, Paul | en_US |
| dc.contributor.other | Theory of Computation | en_US |
| dc.date.accessioned | 2008-06-30T13:00:26Z | |
| dc.date.available | 2008-06-30T13:00:26Z | |
| dc.date.issued | 2007- 11-02 | en_US |
| dc.identifier.other | MIT-CSAIL-TR-2008-039 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/41872 | |
| dc.description.abstract | 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. | en_US |
| dc.format.extent | 30 p. | en_US |
| dc.relation | Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.relation | | en_US |
| dc.subject | Revenue Benchmarks | en_US |
| dc.subject | Revenue lowerbounds | en_US |
| dc.subject | revenue upperbounds | en_US |
| dc.subject | Probabilistic DST mechanisms | en_US |
| dc.title | Revenue in Truly Combinatorial Auctions and Adversarial Mechanism Design | en_US |
