Revisiting the distortion of distributed voting
From MaRDI portal
Publication:6635691
DOI10.1007/S00224-024-10171-1MaRDI QIDQ6635691
Aris Filos-Ratsikas, Alexandros A. Voudouris
Publication date: 12 November 2024
Published in: Theory of Computing Systems (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximating optimal social choice under metric preferences
- Awareness of voter passion greatly improves the distortion of metric social choice
- Optimal social choice functions: a utilitarian view
- Protecting elections by recounting ballots
- The metric distortion of multiwinner voting
- Peeking behind the ordinal curtain: improving distortion via cardinal queries
- Approximate mechanism design for distributed facility location
- Eigentaste: A constant time collaborative filtering algorithm
- Truthful Approximations to Range Voting
- Social Welfare in One-Sided Matchings: Random Priority and Beyond
- Subset Selection Via Implicit Utilitarian Voting
- Manipulation of Schemes that Mix Voting with Chance
- A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching
- Handbook of Computational Social Choice
- The distortion of distributed metric social choice
- The distortion of distributed voting
- Tight distortion bounds for distributed metric voting on a line
- Don’t Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond
- The distortion of distributed facility location
- Primarily about primaries
This page was built for publication: Revisiting the distortion of distributed voting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635691)