-
The Distortion of Distributed Metric Social Choice
We consider a social choice setting with agents that are partitioned int...
07/12/2021 ∙ by Elliot Anshelevich, et al. ∙
0
∙
share
read it
-
Distortion in Social Choice Problems: The First 15 Years and Beyond
The notion of distortion in social choice problems has been defined to m...
03/01/2021 ∙ by Elliot Anshelevich, et al. ∙
0
∙
share
read it
-
Representative Proxy Voting
We study a model of proxy voting where the candidates, voters, and proxi...
12/12/2020 ∙ by Elliot Anshelevich, et al. ∙
0
∙
share
read it
-
Forming better stable solutions in Group Formation Games inspired by Internet Exchange Points (IXPs)
We study a coordination game motivated by the formation of Internet Exch...
08/27/2020 ∙ by Elliot Anshelevich, et al. ∙
0
∙
share
read it
-
Awareness of Voter Passion Greatly Improves the Distortion of Metric Social Choice
We develop new voting mechanisms for the case when voters and candidates...
06/25/2019 ∙ by Ben Abramowitz, et al. ∙
0
∙
share
read it
-
Ordinal Approximation for Social Choice, Matching, and Facility Location Problems given Candidate Positions
In this work we consider general facility location and social choice pro...
05/08/2018 ∙ by Elliot Anshelevich, et al. ∙
0
∙
share
read it
-
Utilitarians Without Utilities: Maximizing Social Welfare for Graph Problems using only Ordinal Preferences - Full Version
We consider ordinal approximation algorithms for a broad class of utilit...
11/28/2017 ∙ by Ben Abramowitz, et al. ∙
0
∙
share
read it
-
Truthful Mechanisms for Matching and Clustering in an Ordinal World
We study truthful mechanisms for matching and related problems in a part...
10/13/2016 ∙ by Elliot Anshelevich, et al. ∙
0
∙
share
read it
-
Randomized Social Choice Functions Under Metric Preferences
We determine the quality of randomized social choice mechanisms in a set...
12/23/2015 ∙ by Elliot Anshelevich, et al. ∙
0
∙
share
read it
-
Blind, Greedy, and Random: Ordinal Approximation Algorithms for Matching and Clustering
We study Matching and other related problems in a partial information se...
12/17/2015 ∙ by Elliot Anshelevich, et al. ∙
0
∙
share
read it
-
Computing Stable Coalitions: Approximation Algorithms for Reward Sharing
Consider a setting where selfish agents are to be assigned to coalitions...
08/27/2015 ∙ by Elliot Anshelevich, et al. ∙
0
∙
share
read it
