research
∙
09/09/2023
A constant factor approximation for Nash social welfare with subadditive valuations
We present a constant-factor approximation algorithm for the Nash social...
share
research
∙
08/19/2023
Bilateral Trade with Correlated Values
We study the bilateral trade problem where a seller owns a single indivi...
research
∙
05/22/2023
On the Computational Complexity of Mechanism Design in Single-Crossing Settings
We explore the performance of polynomial-time incentive-compatible mecha...
research
∙
12/19/2022
Rigidity in Mechanism Design and its Applications
We introduce the notion of rigidity in auction design and use it to anal...
research
∙
07/20/2022
Simplicity in Auctions Revisited: The Primitive Complexity
In this paper we revisit the notion of simplicity in mechanisms. We cons...
research
∙
06/01/2022
On the Hardness of Dominant Strategy Mechanism Design
We study the communication complexity of dominant strategy implementatio...
research
∙
11/20/2021
Mechanism Design with Moral Bidders
A rapidly growing literature on lying in behavioral economics and psycho...
research
∙
11/15/2021
A Note on the Gains from Trade of the Random-Offerer Mechanism
We study the classic bilateral trade setting. Myerson and Satterthwaite ...
research
∙
06/02/2021
Simple Economies are Almost Optimal
Consider a seller that intends to auction some item. The seller can inve...
research
∙
12/29/2020
The Communication Complexity of Payment Computation
Let (f,P) be an incentive compatible mechanism where f is the social cho...
research
∙
07/08/2020
Improved Lower Bounds for Truthful Scheduling
The problem of scheduling unrelated machines by a truthful mechanism to ...
research
∙
05/28/2018
Combinatorial Auctions with Endowment Effect
We study combinatorial auctions with bidders that exhibit endowment effe...
research
∙
04/08/2018