Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Robustly Leveraging Collusion in Combinatorial Auctions

Robustly Leveraging Collusion in Combinatorial Auctions

Thumbnail Image
Download
Name

Micali_Robustly leveraging.pdf

Size

349.39 KB

Format

Adobe PDF

Checksum (MD5)

ecfbd7e082a9af38f23de55cc42aa22d

Author(s)
Chen, Jing
•
Micali, Silvio
•
Valiant, Paul
Date Issued
January 2010
Journal
Symposium on Innovations in Computer Science (ICS) Proceedings
Publisher
Institute for Theoretical Computer Science, Tsinghua University
Citation
Chen, Jing, Silvio Micali, Paul Valiant. "Robustly Leveraging Collusion in Combinatorial Auctions" Symposium on Innovations in Computer Science, January 2010.
Version
Author's final manuscript
Abstract
Because of its devastating effects in auctions and other mechanisms, collusion is prohibited and legally prosecuted. Yet, colluders have always existed, and may continue to exist. We thus raise the following question for mechanism design: What desiderata are achievable, and by what type of mechanisms, when any set of players who wish to collude are free to do so without any restrictions on the way in which they cooperate and coordinate their actions? In response to this question we put forward and exemplify the notion of a collusion-leveraging mechanism. In essence, this is a mechanism aligning its desiderata with the incentives of all its players, including colluders, to a significant and mutually beneficial extent. Of course such mechanisms may exist only for suitable desiderata. In unrestricted combinatorial auctions, where classical mechanisms essentially guarantee 0 social welfare and 0 revenue in the presence of just two colluders, we prove that it is possible for collusion-leveraging mechanisms to guarantee that the sum of social welfare and revenue is always high, even when all players are collusive. To guarantee better performance, collusion-leveraging mechanisms in essence “welcome" collusive players, rather than pretending they do not exist, raising a host of new questions at the intersection of cooperative and noncooperative game theory.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
http://creativecommons.org/licenses/by-nc-sa/3.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/62583
DOI of Published Version
http://conference.itcs.tsinghua.edu.cn/ICS2010/content/paper/Paper_07.pdf
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.