60 citations · 140 across the 33 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.GT2020
The Communication Complexity of Payment Computation
Shahar Dobzinski, Shiri Ron
Let be an incentive compatible mechanism where is the social choice function and is the payment function. In many important settings, uniquely determines (u…
cs.GT2020
Improved Lower Bounds for Truthful Scheduling
Shahar Dobzinski, Ariel Shaulker
The problem of scheduling unrelated machines by a truthful mechanism to minimize the makespan was introduced in the seminal "Algorithmic Mechanism Design" paper by Nisan and Ronen.…