On the Distortion of Voting with Multiple Representative Candidates
November 21, 2017 ยท Declared Dead ยท ๐ AAAI Conference on Artificial Intelligence
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Yu Cheng, Shaddin Dughmi, David Kempe
arXiv ID
1711.07600
Category
cs.GT: Game Theory
Cross-listed
cs.AI
Citations
23
Venue
AAAI Conference on Artificial Intelligence
Last Checked
2 months ago
Abstract
We study positional voting rules when candidates and voters are embedded in a common metric space, and cardinal preferences are naturally given by distances in the metric space. In a positional voting rule, each candidate receives a score from each ballot based on the ballot's rank order; the candidate with the highest total score wins the election. The cost of a candidate is his sum of distances to all voters, and the distortion of an election is the ratio between the cost of the elected candidate and the cost of the optimum candidate. We consider the case when candidates are representative of the population, in the sense that they are drawn i.i.d. from the population of the voters, and analyze the expected distortion of positional voting rules. Our main result is a clean and tight characterization of positional voting rules that have constant expected distortion (independent of the number of candidates and the metric space). Our characterization result immediately implies constant expected distortion for Borda Count and elections in which each voter approves a constant fraction of all candidates. On the other hand, we obtain super-constant expected distortion for Plurality, Veto, and approving a constant number of candidates. These results contrast with previous results on voting with metric preferences: When the candidates are chosen adversarially, all of the preceding voting rules have distortion linear in the number of candidates or voters. Thus, the model of representative candidates allows us to distinguish voting rules which seem equally bad in the worst case.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Game Theory
R.I.P.
๐ป
Ghosted
R.I.P.
๐ป
Ghosted
A Motivational Game-Theoretic Approach for Peer-to-Peer Energy Trading in the Smart Grid
R.I.P.
๐ป
Ghosted
Computing Resource Allocation in Three-Tier IoT Fog Networks: a Joint Optimization Approach Combining Stackelberg Game and Matching
R.I.P.
๐ป
Ghosted
Fast Convergence of Regularized Learning in Games
R.I.P.
๐ป
Ghosted
Computation Peer Offloading for Energy-Constrained Mobile Edge Computing in Small-Cell Networks
R.I.P.
๐ป
Ghosted
Blockchain Mining Games
Died the same way โ ๐ป Ghosted
R.I.P.
๐ป
Ghosted
Language Models are Few-Shot Learners
R.I.P.
๐ป
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
๐ป
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
๐ป
Ghosted