English
Related papers

Related papers: Revisiting the Distortion of Distributed Voting

200 papers

{\em Distortion} is a well-established notion for quantifying the loss of social welfare that may occur in voting. As voting rules take as input only ordinal information, they are essentially forced to neglect the exact values the agents…

Computer Science and Game Theory · Computer Science 2024-10-15 Ioannis Caragiannis , Karl Fehrs

We provide mechanisms and new metric distortion bounds for line-up elections. In such elections, a set of $n$ voters, $m$ candidates, and $\ell$ positions are all located in a metric space. The goal is to choose a set of candidates and…

Computer Science and Game Theory · Computer Science 2025-02-25 Christopher Jerrett , Yue Han , Elliot Anshelevich

A key promise of democratic voting is that, by accounting for all constituents' preferences, it produces decisions that benefit the constituency overall. It is alarming, then, that all deterministic voting rules have unbounded distortion:…

Computer Science and Game Theory · Computer Science 2023-05-22 Bailey Flanigan , Ariel D. Procaccia , Sven Wang

We consider a social choice setting in which agents and alternatives are represented by points in a metric space, and the cost of an agent for an alternative is the distance between the corresponding points in the space. The goal is to…

Computer Science and Game Theory · Computer Science 2023-05-25 Elliot Anshelevich , Aris Filos-Ratsikas , Christopher Jerrett , Alexandros A. Voudouris

We study the problem of designing voting rules that take as input the ordinal preferences of $n$ agents over a set of $m$ alternatives and output a single alternative, aiming to optimize the overall happiness of the agents. The input to the…

Computer Science and Game Theory · Computer Science 2023-06-01 Vasilis Gkatzelis , Mohamad Latifian , Nisarg Shah

In most social choice settings, the participating agents express their preferences over the different alternatives in the form of linear orderings. While this clearly simplifies preference elicitation, it inevitably leads to poor…

Computer Science and Game Theory · Computer Science 2022-10-05 Georgios Amanatidis , Georgios Birmpas , Aris Filos-Ratsikas , Alexandros A. Voudouris

In Spatial Voting Theory, distortion is a measure of how good the winner is. It is proved that no deterministic voting mechanism can guarantee a distortion better than $3$, even for simple metrics such as a line. In this study, we wish to…

Computer Science and Game Theory · Computer Science 2020-08-04 Mohammad Ghodsi , Mohamad Latifian , Masoud Seddighin

We study higher statistical moments of Distortion for randomized social choice in a metric implicit utilitarian model. The Distortion of a social choice mechanism is the expected approximation factor with respect to the optimal utilitarian…

Computer Science and Game Theory · Computer Science 2020-04-29 Brandon Fain , William Fan , Kamesh Munagala

Suppose that we have $n$ agents and $n$ items which lie in a shared metric space. We would like to match the agents to items such that the total distance from agents to their matched items is as small as possible. However, instead of having…

Computer Science and Game Theory · Computer Science 2023-05-23 Nima Anari , Moses Charikar , Prasanna Ramakrishnan

We consider elections where both voters and candidates can be associated with points in a metric space and voters prefer candidates that are closer to those that are farther away. It is often assumed that the optimal candidate is the one…

Computer Science and Game Theory · Computer Science 2019-01-23 Grzegorz Pierczyński , Piotr Skowron

We study social choice rules under the utilitarian distortion framework, with an additional metric assumption on the agents' costs over the alternatives. In this approach, these costs are given by an underlying metric on the set of all…

Computer Science and Game Theory · Computer Science 2021-01-15 Ashish Goel , Anilesh Kollagunta Krishnaswamy , Kamesh Munagala

In the single winner determination problem, we have n voters and m candidates and each voter j incurs a cost c(i, j) if candidate i is chosen. Our objective is to choose a candidate that minimizes the expected total cost incurred by the…

Computer Science and Game Theory · Computer Science 2021-11-18 Haripriya Pulyassary , Chaitanya Swamy

We study the following metric distortion problem: there are two finite sets of points, $V$ and $C$, that lie in the same metric space, and our goal is to choose a point in $C$ whose total distance from the points in $V$ is as small as…

Computer Science and Game Theory · Computer Science 2020-09-08 Vasilis Gkatzelis , Daniel Halpern , Nisarg Shah

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…

Computer Science and Game Theory · Computer Science 2017-11-22 Yu Cheng , Shaddin Dughmi , David Kempe

Distortion-based analysis has established itself as a fruitful framework for comparing voting mechanisms. m voters and n candidates are jointly embedded in an (unknown) metric space, and the voters submit rankings of candidates by…

Computer Science and Game Theory · Computer Science 2019-12-17 David Kempe

Metric distortion in social choice is a framework for evaluating how well voting rules minimize social cost when both voters and candidates exist in a shared metric space, with a voter's cost defined by their distance to a candidate. Voters…

Computer Science and Game Theory · Computer Science 2025-02-14 Mohak Goyal , Sahasrajit Sarmasarkar

We develop a theory of distributive competition under redistricting that explains both electoral outcomes and the equilibrium allocation of policy benefits by endogenizing voter pivotality. In a multi-district model with primaries, general…

General Economics · Economics 2026-04-03 Thomas Groll , Sharyn O'Halloran

In the well-studied metric distortion problem in social choice, we have voters and candidates located in a shared metric space, and the objective is to design a voting rule that selects a candidate with minimal total distance to the voters.…

Computer Science and Game Theory · Computer Science 2025-05-21 Moses Charikar , Prasanna Ramakrishnan , Zihan Tan , Kangning Wang

In district-based elections, electors cast votes in their respective districts. In each district, the party with maximum votes wins the corresponding seat in the governing body. The election result is based on the number of seats won by…

Multiagent Systems · Computer Science 2023-01-24 Adway Mitra

In this paper, we study the metric distortion of deterministic social choice rules that choose a winning candidate from a set of candidates based on voter preferences. Voters and candidates are located in an underlying metric space. A voter…

Computer Science and Game Theory · Computer Science 2019-05-07 Kamesh Munagala , Kangning Wang