MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Computer Science and Artificial Intelligence Lab (CSAIL)
  • CSAIL Digital Archive
  • CSAIL Technical Reports (July 1, 2003 - present)
  • View Item
  • DSpace@MIT Home
  • Computer Science and Artificial Intelligence Lab (CSAIL)
  • CSAIL Digital Archive
  • CSAIL Technical Reports (July 1, 2003 - present)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Resilient Knowledge-Based Mechanisms For Truly Combinatorial Auctions (And Implementation in Surviving Strategies)

Author(s)
Silvio Micali; Theory of Computation; Micali, Silvio; Chen, Jing
Thumbnail
DownloadMIT-CSAIL-TR-2008-071.pdf (325.1Kb)
Additional downloads
MIT-CSAIL-TR-2008-071.ps (1.163Mb)
Other Contributors
Theory of Computation
Advisor
Silvio Micali
Metadata
Show full item record
Abstract
We put forward a new mechanism achieving a high benchmark for (both revenue and) the sum of revenue and efficiency in truly combinatorial auctions. Notably, our mechanism guarantees its performance (1) in a very adversarial collusion model; (2) for any profile of strategies surviving the iterated elimination of dominated strategies; and (3) by leveraging the knowledge that the players have about each other (in a non-Bayesian setting).Our mechanism also is computationally efficient, and preserves the players' privacy to an unusual extent.
Date issued
2008-10-08
URI
http://hdl.handle.net/1721.1/43715
Series/Report no.
MIT-CSAIL-TR-2008-071
Keywords
Implementation in surviving strategies, Resilient Mechanism Design, Privacy-preserving mechanisms, Equilibrium-less mechanism design, Knowledge benchmarks

Collections
  • CSAIL Technical Reports (July 1, 2003 - present)

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.