English
Related papers

Related papers: Optimized Distortion in Linear Social Choice

200 papers

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

Consider the following social choice problem. Suppose we have a set of $n$ voters and $m$ candidates that lie in a metric space. The goal is to design a mechanism to choose a candidate whose average distance to the voters is as small as…

Computer Science and Game Theory · Computer Science 2021-11-09 Moses Charikar , Prasanna Ramakrishnan

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 social choice mechanisms in an implicit utilitarian framework with a metric constraint, where the goal is to minimize \textit{Distortion}, the worst case social cost of an ordinal mechanism relative to underlying cardinal…

Computer Science and Game Theory · Computer Science 2020-07-03 Brandon Fain , Ashish Goel , Kamesh Munagala , Nina Prabhu

After pre-training, large language models are aligned with human preferences based on pairwise comparisons. State-of-the-art alignment methods (such as PPO-based RLHF and DPO) are built on the assumption of aligning with a single preference…

Machine Learning · Computer Science 2025-05-30 Paul Gölz , Nika Haghtalab , Kunhe Yang

In this work we study the metric distortion problem in voting theory under a limited amount of ordinal information. Our primary contribution is threefold. First, we consider mechanisms which perform a sequence of pairwise comparisons…

Computer Science and Game Theory · Computer Science 2021-07-07 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

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

Social choice theory is a theoretical framework for analysis of combining individual preferences, interests, or welfare to reach a collective decision or social welfare in some sense. We introduce a new criterion for social choice protocols…

Multiagent Systems · Computer Science 2019-08-19 Mohammad Ali Javidian , Rasoul Ramezanian

We study single-candidate voting embedded in a metric space, where both voters and candidates are points in the space, and the distances between voters and candidates specify the voters' preferences over candidates. In the voting, each…

Computer Science and Game Theory · Computer Science 2019-11-28 Xujin Chen , Minming Li , Chenhao Wang

We consider a distributed voting problem with a set of agents that are partitioned into disjoint groups and a set of obnoxious alternatives. Agents and alternatives are represented by points in a metric space. The goal is to compute the…

Computer Science and Game Theory · Computer Science 2024-12-17 Alexandros A. Voudouris

Mechanism design is concerned with settings where a policymaker (or social planner) faces the problem of aggregating the announced preferences of multiple agents into a collective (or social), system-wide decision. One of the most important…

Multiagent Systems · Computer Science 2020-03-02 Mohammad Ali Javidian , Pooyan Jamshidi , Marco Valtorta , Rasoul Ramezanian

In the metric distortion problem there is a set of candidates $C$ and voters $V$ in the same metric space. The goal is to select a candidate minimizing the social cost: the sum of distances of the selected candidate from all the voters, and…

Computer Science and Game Theory · Computer Science 2024-07-12 Ben Berger , Michal Feldman , Vasilis Gkatzelis , Xizhi Tan

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

We consider a voting problem in which a set of agents have metric preferences over a set of alternatives, and are also partitioned into disjoint groups. Given information about the preferences of the agents and their groups, our goal is to…

Computer Science and Game Theory · Computer Science 2024-04-23 Georgios Amanatidis , Elliot Anshelevich , Christopher Jerrett , Alexandros A. Voudouris

In voting with ranked ballots, each agent submits a strict ranking of the form $a \succ b \succ c \succ d$ over the alternatives, and the voting rule decides on the winner based on these rankings. Although this ballot format has desirable…

Computer Science and Game Theory · Computer Science 2026-01-06 Mehrad Abbaszadeh , Ali Ansarifar , Mohamad Latifian , Masoud Seddighin

Understanding political phenomena requires measuring the political preferences of society. We introduce a model based on mixtures of spatial voting models that infers the underlying distribution of political preferences of voters with only…

Computers and Society · Computer Science 2016-10-27 Alison Nahm , Alex Pentland , Peter Krafft

Social choice theory is the study of preference aggregation across a population, used both in mechanism design for human agents and in the democratic alignment of language models. In this study, we propose the representative social choice…

Machine Learning · Computer Science 2025-11-03 Tianyi Qiu

Subset selection tasks, arise in recommendation systems and search engines and ask to select a subset of items that maximize the value for the user. The values of subsets often display diminishing returns, and hence, submodular functions…

Machine Learning · Computer Science 2023-05-05 Anay Mehrotra , Nisheeth K. Vishnoi

There is a growing need for discrete choice models that account for the complex nature of human choices, escaping traditional behavioral assumptions such as the transitivity of pairwise preferences. Recently, several parametric models of…

Machine Learning · Computer Science 2018-10-12 Rahul Makhijani