Show simple item record

dc.contributor.advisorSilvio Micali
dc.contributor.authorChen, Jincen_US
dc.contributor.authorMicali, Silvioen_US
dc.contributor.otherTheory of Computationen
dc.date.accessioned2011-04-22T18:45:10Z
dc.date.available2011-04-22T18:45:10Z
dc.date.issued2011-04-22
dc.identifier.urihttp://hdl.handle.net/1721.1/62301
dc.description.abstractFifty years ago, Vickrey published his famous mechanism for auctioning a single good in limited supply. The main property of Vickrey's mechanism is efficiency in dominant strategies. In absence of collusion, this is a wonderful efficiency guarantee. We note, however, that collusion is far from rare in auctions, and if some colluders exist and have some wrong beliefs, then the Vickrey mechanism dramatically loses its efficiency. Accordingly, we put forward a new mechanism that, despite unconstrained collusion, guarantees efficiency by providing a richer set of strategies and ensuring that it is dominant for every player to reveal truthfully not only his own valuation, but also with whom he is colluding, if he is indeed colluding with someone else. Our approach meaningfully bypasses prior impossibility proofs.en_US
dc.format.extent10 p.en_US
dc.relation.ispartofseriesMIT-CSAIL-TR-2011-025
dc.subjectCollusionen_US
dc.subjectAuctionsen_US
dc.subjectEfficiencyen_US
dc.titleCollusive Dominant-Strategy Truthfulnessen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record