English
Related papers

Related papers: Optimized Distortion and Proportional Fairness in …

200 papers

The metric distortion of a randomized social choice function (RSCF) quantifies its worst-case approximation ratio to the optimal social cost when the voters' costs for alternatives are given by distances in a metric space. This notion has…

Computer Science and Game Theory · Computer Science 2025-02-13 Fabian Frank , Patrick Lederer

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

We extend the recently introduced framework of metric distortion to multiwinner voting. In this framework, $n$ agents and $m$ alternatives are located in an underlying metric space. The exact distances between agents and alternatives are…

Computer Science and Game Theory · Computer Science 2022-02-01 Ioannis Caragiannis , Nisarg Shah , Alexandros A. Voudouris

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

Agents vote to choose a fair mixture of public outcomes; each agent likes or dislikes each outcome. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a variant of the random dictator, is Strategyproof and…

Computer Science and Game Theory · Computer Science 2017-12-08 Haris Aziz , Anna Bogomolnaia , Herve Moulin

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

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

Strategic voting, or manipulation, is the process by which a voter misrepresents his preferences in an attempt to elect an outcome that he considers preferable to the outcome under sincere voting. It is generally agreed that manipulation is…

Computer Science and Game Theory · Computer Science 2022-11-10 Egor Ianovski , Daria Teplova , Valeriia Kuka

We study the performance of voting mechanisms from a utilitarian standpoint, under the recently introduced framework of metric-distortion, offering new insights along three main lines. First, if $d$ represents the doubling dimension of the…

Computer Science and Game Theory · Computer Science 2022-03-25 Ioannis Anagnostides , Dimitris Fotakis , Panagiotis Patsilinakos

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

In distortion-based analysis of social choice rules over metric spaces, one assumes that all voters and candidates are jointly embedded in a common metric space. Voters rank candidates by non-decreasing distance. The mechanism, receiving…

Computer Science and Game Theory · Computer Science 2019-11-21 David Kempe

To choose a suitable multiwinner voting rule is a hard and ambiguous task. Depending on the context, it varies widely what constitutes the choice of an ``optimal'' subset of alternatives. In this paper, we provide a quantitative analysis of…

Multiagent Systems · Computer Science 2020-09-01 Martin Lackner , Piotr Skowron

Multiwinner voting rules are used to select a small representative subset of candidates or items from a larger set given the preferences of voters. However, if candidates have sensitive attributes such as gender or ethnicity (when selecting…

Computers and Society · Computer Science 2018-06-20 L. Elisa Celis , Lingxiao Huang , Nisheeth K. Vishnoi

We revisit the recent breakthrough result of Gkatzelis et al. on (single-winner) metric voting, which showed that the optimal distortion of 3 can be achieved by a mechanism called Plurality Matching. The rule picks an arbitrary candidate…

Computer Science and Game Theory · Computer Science 2025-02-05 Fatih Erdem Kizilkaya , David Kempe

In light of the classic impossibility results of Arrow and Gibbard and Satterthwaite regarding voting with ordinal rules, there has been recent interest in characterizing how well common voting rules approximate the social optimum. In order…

Computer Science and Game Theory · Computer Science 2017-08-29 Yu Cheng , Shaddin Dughmi , David Kempe

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

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

In this paper, we study the distortion bounds for voting mechanisms in multi-winner elections in general metric spaces. Our study pertains to the case in which each voter only reports her favorite candidate amongst $m$ possible choices.…

Computer Science and Game Theory · Computer Science 2025-05-29 Gennaro Auricchio , Zeyu Ren , Zihe Wang , Jie Zhang

We consider the fundamental mechanism design problem of approximate social welfare maximization under general cardinal preferences on a finite number of alternatives and without money. The well-known range voting scheme can be thought of as…

Computer Science and Game Theory · Computer Science 2014-09-12 Aris Filos-Ratsikas , Peter Bro Miltersen