4 citations · 4 across the 1 of their papers we have counts for
2 papers
cs.AI2015
Randomized Social Choice Functions Under Metric Preferences
Elliot Anshelevich, John Postl
We determine the quality of randomized social choice mechanisms in a setting in which the agents have metric preferences: every agent has a cost for each alternative, and these cos…
cs.GT2013★ 4 cited
Assignment Games with Conflicts: Price of Total Anarchy and Convergence Results via Semi-Smoothness
Elliot Anshelevich, John Postl, Tom Wexler
We study assignment games in which jobs select machines, and in which certain pairs of jobs may conflict, which is to say they may incur an additional cost when they are both assig…