English
Related papers

Related papers: Random errors are not necessarily politically neut…

200 papers

Despite extensive theoretical research on proportionality in approval-based multiwinner voting, its impact on which committees and candidates can be selected in practice remains poorly understood. We address this gap by (i) analyzing the…

Computer Science and Game Theory · Computer Science 2025-11-13 Niclas Boehmer , Lara Glessen , Jannik Peters

We study ballot exhaustion in multiwinner single transferable vote (STV) elections using a dataset of 1,070 Scottish local government elections comprising over 5.4 million ballots. While ballot exhaustion has been studied extensively in…

General Economics · Economics 2026-05-14 David McCune , E. E. Naber

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

We analyse strategic, complete information, sequential voting with ordinal preferences over the alternatives. We consider several voting mechanisms: plurality voting and approval voting with deterministic or uniform tie-breaking rules. We…

Computer Science and Game Theory · Computer Science 2019-04-19 Oren Dean , Yakov Babichenko , Moshe Tennenholtz

Ranked choice voting is vulnerable to monotonicity failure - a voting failure where a candidate is cost an election due to losing voter preference or granted an election due to gaining voter preference. Despite increasing use of ranked…

Theoretical Economics · Economics 2023-10-23 Rylie Weaver

We evaluate the tendency for different voting methods to promote political compromise and reduce tensions in a society by using computer simulations to determine which voters candidates are incentivized to appeal to. We find that Instant…

General Economics · Economics 2024-04-04 Marcus Ogren

How often will elections end in landslides? What is the probability for a head-to-head race? Analyzing ballot results from several large countries rather anomalous and yet unexplained distributions have been observed. We identify tactical…

Physics and Society · Physics 2010-09-17 Nuno A. M. Araújo , José S. Andrade , Hans J. Herrmann

An important problem in computational social choice theory is the complexity of undesirable behavior among agents, such as control, manipulation, and bribery in election systems. These kinds of voting strategies are often tempting at the…

Artificial Intelligence · Computer Science 2012-04-20 Andrew Lin

Voting by sequential elimination is a low-communication voting protocol: voters play in sequence and eliminate one or more of the remaining candidates, until only one remains. While the fairness and efficiency of such protocols have been…

Computer Science and Game Theory · Computer Science 2022-10-18 Ulysse Pavloff , Tristan Cazenave , Jérôme Lang

Since the 1970s there has been a large number of countries that combine formal democratic institutions with authoritarian practices. Although in such countries the ruling elites may receive considerable voter support they often employ…

Applications · Statistics 2016-04-27 Raúl Jiménez , Manuel Hidalgo , Peter Klimek

Participatory budgeting, as a paradigm for democratic innovations, engages citizens in the distribution of a public budget to projects, which they propose and vote for implementation. So far, voting algorithms have been proposed and studied…

Multiagent Systems · Computer Science 2024-10-30 Sajan Maharjan , Srijoni Majumdar , Evangelos Pournaras

There are many situations in which mis-coordinated strategic voting can leave strategic voters worse off than they would have been had they not tried to strategize. We analyse the simplest of such scenarios, in which the set of strategic…

Computer Science and Game Theory · Computer Science 2013-01-09 Arkadii Slinko , Shaun White

Instant Runoff Voting (IRV) is used in elections for many political offices around the world. It allows voters to specify their preferences among candidates as a ranking. We identify a generalization of the rule, called Approval-IRV, that…

Computer Science and Game Theory · Computer Science 2024-04-18 Théo Delemazure , Dominik Peters

Accounting for undecided and uncertain voters is a challenging issue for predicting election results from public opinion polls. Undecided voters typify the uncertainty of swing voters in polls but are often ignored or allocated to each…

Applications · Statistics 2019-01-18 Joshua J Bon , Timothy Ballard , Bernard Baffour

The proportional veto principle, which captures the idea that a candidate vetoed by a large group of voters should not be chosen, has been studied for ranked ballots in single-winner voting. We introduce a version of this principle for…

Computer Science and Game Theory · Computer Science 2025-05-05 Daniel Halpern , Ariel D. Procaccia , Warut Suksompong

In the single winner determination problem, we have n voters and m candidates and each voter j incurs a cost c(i, j) if candidate i is chosen. Our objective is to choose a candidate that minimizes the expected total cost incurred by the…

Computer Science and Game Theory · Computer Science 2021-11-18 Haripriya Pulyassary , Chaitanya Swamy

We investigate how robust approval-based multiwinner voting rules are to small perturbations in the votes. In particular, we consider the extent to which a committee can change after we add/remove/swap one approval, and we consider the…

Computer Science and Game Theory · Computer Science 2026-01-28 Piotr Faliszewski , Grzegorz Gawron , Bartosz Kusek

In the United States electoral system, a candidate is elected indirectly by winning a majority of electoral votes cast by individual states, the election usually being decided by the votes cast by a small number of "swing states" where the…

Physics and Society · Physics 2012-11-06 G. C. Levine , B. Caravan , J. E. Cerise

Elections involving a very large voter population often lead to outcomes that surprise many. This is particularly important for the elections in which results affect the economy of a sizable population. A better prediction of the true…

Computer Science and Game Theory · Computer Science 2018-01-31 Palash Dey , Pravesh K. Kothari , Swaprava Nath

Instant runoff voting (IRV) has recently gained popularity as an alternative to plurality voting for political elections, with advocates claiming a range of advantages, including that it produces more moderate winners than plurality and…

Multiagent Systems · Computer Science 2024-01-19 Kiran Tomlinson , Johan Ugander , Jon Kleinberg