2 papers
cs.GT2023
Impossibilities for Obviously Strategy-Proof Mechanisms
Shiri Ron
We explore the approximation power of deterministic obviously strategy-proof mechanisms in auctions, where the objective is welfare maximization. A trivial ascending auction on the…
cs.GT2023
On the Computational Complexity of Mechanism Design in Single-Crossing Settings
Moshe Babaioff, Shahar Dobzinski, Shiri Ron
We explore the performance of polynomial-time incentive-compatible mechanisms in single-crossing domains. Single-crossing domains were extensively studied in the economics literatu…