English
Related papers

Related papers: Optimized Distortion in Linear Social Choice

200 papers

A voting rule decides on a probability distribution over a set of m alternatives, based on rankings of those alternatives provided by agents. We assume that agents have cardinal utility functions over the alternatives, but voting rules have…

Computer Science and Game Theory · Computer Science 2024-01-23 Soroush Ebadian , Anson Kahng , Dominik Peters , Nisarg Shah

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 study the utilitarian distortion of social choice mechanisms under the recently proposed learning-augmented framework where some (possibly unreliable) predicted information about the preferences of the agents is given as input. In…

Computer Science and Game Theory · Computer Science 2025-02-11 Aris Filos-Ratsikas , Georgios Kalantzis , Alexandros A. Voudouris

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

Selecting representatives based on voters' preferences is a fundamental problem in social choice theory. While cardinal utility functions offer a detailed representation of preferences, ordinal rankings are often the only available…

Computer Science and Game Theory · Computer Science 2024-12-17 Kiarash Banihashem , Diptarka Chakraborty , Shayan Chashm Jahan , Iman Gholami , MohammadTaghi Hajiaghayi , Mohammad Mahdavi , Max Springer

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

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

We consider a social choice setting with agents that are partitioned into disjoint groups, and have metric preferences over a set of alternatives. Our goal is to choose a single alternative aiming to optimize various objectives that are…

Computer Science and Game Theory · Computer Science 2021-07-13 Elliot Anshelevich , Aris Filos-Ratsikas , Alexandros A. Voudouris

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

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

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 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

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 consider models for social choice where voters rank a set of choices (or alternatives) by deliberating in small groups of size at most $k$, and these outcomes are aggregated by a social choice rule to find the winning alternative. We…

Computer Science and Game Theory · Computer Science 2025-03-21 Ashish Goel , Mohak Goyal , Kamesh Munagala

We consider a setting with agents that have preferences over alternatives and are partitioned into disjoint districts. The goal is to choose one alternative as the winner using a mechanism which first decides a representative alternative…

Computer Science and Game Theory · Computer Science 2023-01-10 Aris Filos-Ratsikas , Alexandros A. Voudouris

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 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

We determine the quality of randomized social choice mechanisms in a setting in which the agents have metric preferences: every agent has a cost for each alternative, and these costs form a metric. We assume that these costs are unknown to…

Artificial Intelligence · Computer Science 2016-09-27 Elliot Anshelevich , John Postl

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

We develop new voting mechanisms for the case when voters and candidates are located in an arbitrary unknown metric space, and the goal is to choose a candidate minimizing social cost: the total distance from the voters to this candidate.…

Artificial Intelligence · Computer Science 2019-06-26 Ben Abramowitz , Elliot Anshelevich , Wennan Zhu
‹ Prev 1 2 3 10 Next ›