68 citations · 73 across the 5 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
cs.GT2022
On the Hardness of Dominant Strategy Mechanism Design
Shahar Dobzinski, Shiri Ron, Jan Vondrák
We study the communication complexity of dominant strategy implementations of combinatorial auctions. We start with two domains that are generally considered "easy": multi-unit auc…
cs.GT2021
Fixed-Price Approximations in Bilateral Trade
Zi Yang Kang, Francisco Pernice, Jan Vondrák
We consider the bilateral trade problem, in which two agents trade a single indivisible item. It is known that the only dominant-strategy truthful mechanism is the fixed-price mech…
cs.GT2021★ 4 cited
A constant-factor approximation algorithm for Nash Social Welfare with submodular valuations
Wenzheng Li, Jan Vondrák
We present a -approximation algorithm for the Nash Social Welfare problem with submodular valuations. Our algorithm builds on and extends a recent constant-factor approximatio…