English
Related papers

Related papers: Optimized Distortion and Proportional Fairness in …

200 papers

Social choice theory offers a wealth of approaches for selecting a candidate on behalf of voters based on their reported preference rankings over options. When voters have underlying utilities for these options, however, using preference…

Computer Science and Game Theory · Computer Science 2025-10-24 Luise Ge , Gregory Kehne , Yevgeniy Vorobeychik

One way of evaluating social choice (voting) rules is through a utilitarian distortion framework. In this model, we assume that agents submit full rankings over the alternatives, and these rankings are generated from underlying, but…

Computer Science and Game Theory · Computer Science 2018-10-03 Ashish Goel , Reyna Hulett , Anilesh K. Krishnaswamy

{\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 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 computational social choice, the distortion of a voting rule quantifies the degree to which the rule overcomes limited preference information to select a socially desirable outcome. This concept has been investigated extensively, but…

Computer Science and Game Theory · Computer Science 2023-12-11 Yannai A. Gonczarowski , Gregory Kehne , Ariel D. Procaccia , Ben Schiffer , Shirley Zhang

Voting can abstractly model any decision-making scenario and as such it has been extensively studied over the decades. Recently, the related literature has focused on quantifying the impact of utilizing only limited information in the…

Computer Science and Game Theory · Computer Science 2020-01-07 Aris Filos-Ratsikas , Evi Micha , Alexandros A. Voudouris

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

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

The utilitarian distortion framework evaluates voting rules by their worst-case efficiency loss when voters have cardinal utilities but express only ordinal rankings. Under the classical model, a longstanding tension exists: Plurality,…

Computer Science and Game Theory · Computer Science 2026-02-12 Hamidreza Alipour , Mohak Goyal

We consider the following well-studied problem of metric distortion in social choice. Suppose we have an election with $n$ voters and $m$ candidates located in a shared metric space. We would like to design a voting rule that chooses a…

Computer Science and Game Theory · Computer Science 2024-11-07 Moses Charikar , Prasanna Ramakrishnan , Kangning Wang , Hongxun Wu

The metric distortion framework posits that n voters and m candidates are jointly embedded in a metric space such that voters rank candidates that are closer to them higher. A voting rule's purpose is to pick a candidate with minimum total…

Computer Science and Game Theory · Computer Science 2023-07-03 Fatih Erdem Kizilkaya , David Kempe

We study the problem of minimizing metric distortion in multi-winner elections, where a committee of size $k$ is selected from a set of candidates based on voters' ordinal preferences. We assume that voters and candidates are embedded on a…

Computer Science and Game Theory · Computer Science 2026-02-18 Negar Babashah , Hasti Karimi , Masoud Seddighin , Golnoosh Shahkarami

In the context of single-winner ranked-choice elections between $m$ candidates, we explore the tradeoff between two competing goals in every democratic system: the majority principle (maximizing the social welfare) and the minority…

Computer Science and Game Theory · Computer Science 2025-07-25 Fatih Erdem Kizilkaya , 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

In the metric distortion problem, a set of voters and candidates lie in a common metric space, and a committee of $k$ candidates must be elected. The objective is to minimize a social cost, defined as a function of the distances between…

Computer Science and Game Theory · Computer Science 2025-10-16 Javier Cembrano , Golnoosh Shahkarami

We study the design of voting rules in the metric distortion framework. It is known that any deterministic rule suffers distortion of at least $3$, and that randomized rules can achieve distortion strictly less than $3$, often at the cost…

Computer Science and Game Theory · Computer Science 2026-02-10 Ziyi Cai , D. D. Gao , Prasanna Ramakrishnan , Kangning Wang

The notion of distortion in social choice problems has been defined to measure the loss in efficiency -- typically measured by the utilitarian social welfare, the sum of utilities of the participating agents -- due to having access only to…

Computer Science and Game Theory · Computer Science 2021-03-02 Elliot Anshelevich , Aris Filos-Ratsikas , Nisarg Shah , Alexandros A. Voudouris

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

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

In this note, we uncover three connections between the metric distortion problem and voting methods and axioms from the social choice literature.

Computer Science and Game Theory · Computer Science 2023-05-16 Jannik Peters
‹ Prev 1 2 3 10 Next ›