English
Related papers

Related papers: Distortion in Social Choice Problems: The First 15…

200 papers

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 study matching settings in which a set of agents have private utilities over a set of items. Each agent reports a partition of the items into approval sets of different threshold utility levels. Given this limited information on input,…

Computer Science and Game Theory · Computer Science 2024-01-19 Mohamad Latifian , Alexandros A. Voudouris

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

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 consider the one-sided matching problem, where n agents have preferences over n items, and these preferences are induced by underlying cardinal valuation functions. The goal is to match every agent to a single item so as to maximize the…

Computer Science and Game Theory · Computer Science 2020-09-15 Georgios Amanatidis , Georgios Birmpas , Aris Filos-Ratsikas , Alexandros A. Voudouris

The efficient use of available resources is a key factor in achieving success on both personal and organizational levels. One of the crucial resources in knowledge economy is time. The ability to force others to adapt to our schedule even…

Multiagent Systems · Computer Science 2017-06-06 Michal Kakol , Radoslaw Nielek , Adam Wierzbicki

Recent works have studied the design of algorithms for selecting representative sortition panels. However, the most central question remains unaddressed: Do these panels reflect the entire population's opinion? We present a positive answer…

Computer Science and Game Theory · Computer Science 2024-06-05 Ioannis Caragiannis , Evi Micha , Jannik Peters

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

Snapshots of "best" (or "worst") experience are known to dominate human memory and may thus also have a significant effect on future behaviour. We consider here a model of repeated decision-making where, at every time step, an agent takes…

Statistical Mechanics · Physics 2022-02-18 Evangelos Mitsokapas , Rosemary J. Harris

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

Social disruption occurs when a policy creates or destroys many network connections between agents. It is a costly side effect of many interventions and so a growing empirical literature recommends measuring and accounting for social…

Econometrics · Economics 2025-07-29 Eric Auerbach , Yong Cai

Many visual representations, such as volume-rendered images and metro maps, feature a noticeable amount of information loss. At a glance, there seem to be numerous opportunities for viewers to misinterpret the data being visualized, hence…

Human-Computer Interaction · Computer Science 2022-04-05 Min Chen , Alfie Abdul-Rahman , Deborah Silver , Mateu Sbert

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

There is a consensus that human and non-human subjects experience temporal distortions in many stages of their perceptual and decision-making systems. Similarly, intertemporal choice research has shown that decision-makers undervalue future…

Neurons and Cognition · Quantitative Biology 2016-05-31 Pedro A. Ortega , Naftali Tishby

We consider the distributed single-winner metric voting problem on a line, where agents and alternative are represented by points on the line of real numbers, the agents are partitioned into disjoint districts, and the goal is to choose a…

Computer Science and Game Theory · Computer Science 2023-01-05 Alexandros A. Voudouris

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

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

Current methodologies in machine learning analyze the effects of various statistical parity notions of fairness primarily in light of their impacts on predictive accuracy and vendor utility loss. In this paper, we propose a new framework…

Machine Learning · Computer Science 2018-07-04 Lily Hu , Yiling Chen