Show simple item record

Knowledge Benchmarks in Adversarial Mechanism Design and Implementation in Surviving Strategies (Part I)

dc.date.accessioned2008-07-09T22:15:19Z
dc.date.accessioned2018-11-26T22:25:21Z
dc.date.available2008-07-09T22:15:19Z
dc.date.available2018-11-26T22:25:21Z
dc.date.issued2008-06en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/41877
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/41877
dc.description.abstractWe put forward new benchmarks and solution concepts for Adversarial Mechanism Design, as defined by [MV07.a], and we exemplify them in the case of truly combinatorial auctions.We benchmark the combined performance (the sum of the auction's efficiency and revenue) of a truly combinatorial auction against a very relevant but private knowledge of the players: essentially, the maximum revenue that the best informed player could guarantee if he were the seller. (I.e., by offering each other player a subset of the goods for a take-it-or-leave-it price.)We achieve this natural benchmark within a factor of 2, by means of a new and probabilistic auction mechanism, in surviving strategies. That is, the above performance of our mechanism is guaranteed in any rational play, independent of any possible beliefs of the players. Indeed, our performance guarantee holds for any possible choice of strategies, so long as each player chooses a strategy among those surviving iterated elimination of dominated strategies.Our mechanism is extremely robust. Namely, its performance guarantees hold even if all but one of the players collude (together or in separate groups) in any possible but reasonable way. Essentially, the only restriction for the collective utility function of a collusive subset S of the players is the following: the collective utility increases when one member of S is allocated a ubset of the goods "individually better" for him and/or his "individual price" is smaller, while the allocations and prices of all other members of S stay the same.Our results improve on the yet unpublished ones of [MV07.b]. The second part of this paper, dealing with a more aggressive benchmark (essentially, the maximum welfare privately known to the players) is forthcoming.en_US
dc.format.extent17 p.en_US
dc.relationMassachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratoryen_US
dc.relationen_US
dc.titleKnowledge Benchmarks in Adversarial Mechanism Design and Implementation in Surviving Strategies (Part I)en_US


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2008-041.pdf271.7Kbapplication/pdfView/Open
MIT-CSAIL-TR-2008-041.ps73.87Kbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record