English
Related papers

Related papers: Designing Stable Elections: A Survey

200 papers

We consider synchronous iterative voting, where voters are given the opportunity to strategically choose their ballots depending on the outcome deduced from the previous collective choices.We propose two settings for synchronous iterative…

Computer Science and Game Theory · Computer Science 2022-02-11 Benoît Kloeckner

The voting systems known as Alternative Vote (AV) and Single Transferable Vote (STV) are extensively used for elections in Australia, possibly more than in any other jurisdiction. Often proposed as superior alternatives to Plurality and…

Physics and Society · Physics 2025-07-22 Anthony B. Morton

By the Gibbard--Satterthwaite theorem, every reasonable voting rule for three or more alternatives is susceptible to manipulation: there exist elections where one or more voters can change the election outcome in their favour by…

Computer Science and Game Theory · Computer Science 2017-07-28 Edith Elkind , Umberto Grandi , Francesca Rossi , Arkadii Slinko

In a single winner election with several candidates and ranked choice or rating scale ballots, a Condorcet winner is one who wins all their two way races by majority rule or MR. A voting system has Condorcet consistency or CC if it names…

Methodology · Statistics 2017-06-07 Richard B. Darlington

We study the phenomenon of intransitivity in models of dice and voting. First, we follow a recent thread of research for $n$-sided dice with pairwise ordering induced by the probability, relative to $1/2$, that a throw from one die is…

Probability · Mathematics 2020-10-27 Jan Hązła , Elchanan Mossel , Nathan Ross , Guangqu Zheng

Understanding the nature of strategic voting is the holy grail of social choice theory, where game-theory, social science and recently computational approaches are all applied in order to model the incentives and behavior of voters. In a…

Multiagent Systems · Computer Science 2014-11-19 Reshef Meir

Control and manipulation are two of the most studied types of attacks on elections. In this paper, we study the complexity of control attacks on elections in which there are manipulators. We study both the case where the "chair" who is…

Computer Science and Game Theory · Computer Science 2017-06-09 Zack Fitzsimmons , Edith Hemaspaandra , Lane A. Hemaspaandra

Two-sided matching markets describe a large class of problems wherein participants from one side of the market must be matched to those from the other side according to their preferences. In many real-world applications (e.g. content…

Computer Science and Game Theory · Computer Science 2024-10-16 Hadi Hosseini , Sanjukta Roy , Duohan Zhang

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

In recent years, opinion dynamics has received an increasing attention, and various models have been introduced and evaluated mainly by simulation. In this study, we introduce and study a dynamical model inspired by the so-called `bounded…

Dynamical Systems · Mathematics 2018-11-07 Sergei Yu. Pilyugin , M. C. Campi

In collective decision making, where a voting rule is used to take a collective decision among a group of agents, manipulation by one or more agents is usually considered negative behavior to be avoided, or at least to be made…

Artificial Intelligence · Computer Science 2013-03-05 Umberto Grandi , Andrea Loreggia , Francesca Rossi , Kristen Brent Venable , Toby Walsh

Maximum likelihood estimation furnishes powerful insights into voting theory, and the design of voting rules. However the MLE can usually be badly corrupted by a single outlying sample. This means that a single voter or a group of colluding…

Data Structures and Algorithms · Computer Science 2022-07-19 Allen Liu , Ankur Moitra

We study a model of temporal voting where there is a fixed time horizon, and at each round the voters report their preferences over the available candidates and a single candidate is selected. Prior work has adapted popular notions of…

Computer Science and Game Theory · Computer Science 2025-02-11 Edith Elkind , Svetlana Obraztsova , Jannik Peters , Nicholas Teh

We study vote delegation with "well-behaving" and "misbehaving" agents and compare it with conventional voting. Typical examples for vote delegation are validation or governance tasks on blockchains. There is a majority of well-behaving…

Computer Science and Game Theory · Computer Science 2021-05-18 Hans Gersbach , Akaki Mamageishvili , Manvir Schneider

Analyses of voting algorithms often overlook informational externalities shaping individual votes. For example, pre-polling information often skews voters towards candidates who may not be their top choice, but who they believe would be a…

Computer Science and Game Theory · Computer Science 2024-04-12 Yiling Chen , Jessie Finocchiaro

In almost every election cycle, the validity of the United States Electoral College is brought into question. The 2016 Presidential Election again brought up the issue of a candidate winning the popular vote but not winning the Electoral…

General Economics · Economics 2019-01-24 Robert Chuchro , Kyle D'Souza , Darren Mei

We study the design of voting mechanisms in a binary social choice environment where agents' cardinal valuations are independent but not necessarily identically distributed. The mechanism must be anonymous -- the outcome is invariant to…

Theoretical Economics · Economics 2025-08-12 Yaron Azrieli , Ritesh Jain , Semin Kim

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

Quality assurance remains a key topic in human computation research. Prior work indicates that majority voting is effective for low difficulty tasks, but has limitations for harder tasks. This paper explores two methods of addressing this…

Social and Information Networks · Computer Science 2012-04-17 Yu-An Sun , Christopher Dance

Electing a single committee of a small size is a classical and well-understood voting situation. Being interested in a sequence of committees, we introduce and study two time-dependent multistage models based on simple Plurality voting.…

Computational Complexity · Computer Science 2024-01-22 Robert Bredereck , Till Fluschnik , Andrzej Kaczmarczyk
‹ Prev 1 8 9 10 Next ›