68 citations · 73 across the 5 of their papers we have counts for
Showing 2022Show all
2 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.DM2022
On complex roots of the independence polynomial
Ferenc Bencs, Péter Csikvári, Piyush Srivastava +1
It is known from the work of Shearer (1985) (and also Scott and Sokal (2005)) that the independence polynomial of a graph of maximum degree at most does not vani…