Show simple item record

dc.contributor.advisorSilvio Micali
dc.contributor.authorChen, Jingen_US
dc.contributor.authorMicali, Silvioen_US
dc.contributor.otherTheory of Computationen_US
dc.date.accessioned2008-10-08T20:15:07Z
dc.date.available2008-10-08T20:15:07Z
dc.date.issued2008-10-08
dc.identifier.urihttp://hdl.handle.net/1721.1/42893
dc.description.abstractFollowing Micali and Valiant [MV07.a], a mechanism is resilient if it achieves its objective without any problem of (1) equilibrium selection and (2) player collusion. To advance resilient mechanism design,We put forward a new meaningful benchmark for the COMBINED social welfare-revenue performance of any mechanism in truly combinatorial auctions.We put forward a NEW notion of implementation, much more general than the ones used so far, which we believe to be of independent interest.We put forward a new RESILIENT mechanism that, by leveraging the knowledge that the players have about each other, guarantees at least one half of our benchmark under a very general collusion model.en_US
dc.format.extent32 p.en_US
dc.relationMIT-CSAIL-TR-2008-041
dc.relation.ispartofseriesMIT-CSAIL-TR-2008-059
dc.subjectknowledge benchmarksen_US
dc.subjectimplementation in surviving strategiesen_US
dc.subjectequilibrium-less implementationen_US
dc.subjectcombinatorial auctionsen_US
dc.subjectresilient mechanismsen_US
dc.subjectcollusionen_US
dc.subjecttruly combinatorial auctionsen_US
dc.titleNew Resiliency in Truly Combinatorial Auctions (and Implementation in Surviving Strategies)en_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record