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
AbstractGreen and Laffont proved that no collusion-resilient dominant-strategy mechanism, whose stra...
Fifty years ago, Vickrey published his famous mechanism for auctioning a single good in limited supp...
In unrestricted combinatorial auctions, we put forward a mechanism that guarantees a meaningful reve...
Dominant-strategy truthfulness is traditionally considered the best possible solution concept in mec...
Following Micali and Valiant [MV07.a], a mechanism is resilient if it achieves its objective without...
In auctions of a single good, the second-price mechanism achieves, in dominantstrategies, a revenue ...
We put forward new benchmarks and solution concepts for Adversarial Mechanism Design, as defined by ...
We put forward new benchmarks and solution concepts for Adversarial Mechanism Design, as defined by ...
We put forward a new approach to mechanism design, and exemplify it via a new mechanism guaranteeing...
Because of its devastating effects in auctions and other mechanisms, collusion is prohibited and le...
Micali and Valiant proposed a mechanism for combinatorial auctions that is dominant-strategy truthfu...
Green and Laffont [1] have proven that no collusion-resilient dominant-strategy mechanism guarantees...
Because of its devastating effects in auctions and other mechanisms, collusion is prohibited and leg...
AbstractGreen and Laffont proved that no collusion-resilient dominant-strategy mechanism, whose stra...
© 2016 The Authors Green and Laffont proved that no collusion-resilient dominant-strategy mechanism,...
AbstractGreen and Laffont proved that no collusion-resilient dominant-strategy mechanism, whose stra...
Fifty years ago, Vickrey published his famous mechanism for auctioning a single good in limited supp...
In unrestricted combinatorial auctions, we put forward a mechanism that guarantees a meaningful reve...
Dominant-strategy truthfulness is traditionally considered the best possible solution concept in mec...
Following Micali and Valiant [MV07.a], a mechanism is resilient if it achieves its objective without...
In auctions of a single good, the second-price mechanism achieves, in dominantstrategies, a revenue ...
We put forward new benchmarks and solution concepts for Adversarial Mechanism Design, as defined by ...
We put forward new benchmarks and solution concepts for Adversarial Mechanism Design, as defined by ...
We put forward a new approach to mechanism design, and exemplify it via a new mechanism guaranteeing...
Because of its devastating effects in auctions and other mechanisms, collusion is prohibited and le...
Micali and Valiant proposed a mechanism for combinatorial auctions that is dominant-strategy truthfu...
Green and Laffont [1] have proven that no collusion-resilient dominant-strategy mechanism guarantees...
Because of its devastating effects in auctions and other mechanisms, collusion is prohibited and leg...
AbstractGreen and Laffont proved that no collusion-resilient dominant-strategy mechanism, whose stra...
© 2016 The Authors Green and Laffont proved that no collusion-resilient dominant-strategy mechanism,...
AbstractGreen and Laffont proved that no collusion-resilient dominant-strategy mechanism, whose stra...
Fifty years ago, Vickrey published his famous mechanism for auctioning a single good in limited supp...
In unrestricted combinatorial auctions, we put forward a mechanism that guarantees a meaningful reve...