English
Related papers

Related papers: Bucklin Voting is Broadly Resistant to Control

200 papers

Online voting is attractive for convenience and accessibility, but is more susceptible to voter coercion and vote buying than in-person voting. One mitigation is to give voters fake voting credentials that they can yield to a coercer. Fake…

Human-Computer Interaction · Computer Science 2024-04-19 Louis-Henri Merino , Alaleh Azhir , Haoqian Zhang , Simone Colombo , Bernhard Tellenbach , Vero Estrada-Galiñanes , Bryan Ford

To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated according to a voting protocol. However, in realistic settings,…

Computational Complexity · Computer Science 2010-05-03 Nadja Betzler , Britta Dorn

This article analyses three methods of remote voting in an uncontrolled environment: postal voting, internet voting and hybrid voting. It breaks down the voting process into different stages and compares their vulnerabilities considering…

Computers and Society · Computer Science 2009-08-10 Chantal Enguehard , Rémi Lehn

In a voting problem with a finite set of alternatives to choose from, we study the manipulation of tops-only rules. Since all non-dictatorial (onto) voting rules are manipulable when there are more than two alternatives and all preferences…

Theoretical Economics · Economics 2022-10-24 R. Pablo Arribillaga , Agustin G. Bonifacio

While manipulative attacks on elections have been well-studied, only recently has attention turned to attacks that account for geographic information, which are extremely common in the real world. The most well known in the media is…

Computer Science and Game Theory · Computer Science 2020-03-17 Zack Fitzsimmons , Omer Lev

We view voting rules as classifiers that assign a winner (a class) to a profile of voters' preferences (an instance). We propose to apply techniques from formal explainability, most notably abductive and contrastive explanations, to…

Artificial Intelligence · Computer Science 2024-08-27 Clément Contet , Umberto Grandi , Jérôme Mengin

We consider manipulation problems when the manipulator only has partial information about the votes of the nonmanipulators. Such partial information is described by an information set, which is the set of profiles of the nonmanipulators…

Artificial Intelligence · Computer Science 2011-06-28 Vincent Conitzer , Toby Walsh , Lirong Xia

Questions in causality, control, and reinforcement learning go beyond the classical machine learning task of prediction under i.i.d. observations. Instead, these fields consider the problem of learning how to actively perturb a system to…

Successive elimination of candidates is often a route to making manipulation intractable to compute. We prove that eliminating candidates does not necessarily increase the computational complexity of manipulation. However, for many voting…

Artificial Intelligence · Computer Science 2012-04-19 Jessica Davies , Nina Narodytska , Toby Walsh

The simplified hypothesis that an election is polarized as an explanation of recent electoral outcomes worldwide is centered on perceptions of voting patterns rather than ideological data from the electorate. While the literature focuses on…

Computers and Society · Computer Science 2024-07-30 Carlos Navarrete , Mariana Macedo , Viktor Stojkoski , Marcela Parada-Contzen , Christopher A Martínez

We investigate how robust the results of committee elections are to small changes in the input preference orders, depending on the voting rules used. We find that for typical rules the effect of making a single swap of adjacent candidates…

Computer Science and Game Theory · Computer Science 2019-07-24 Robert Bredereck , Piotr Faliszewski , Andrzej Kaczmarczyk , Rolf Niedermeier , Piotr Skowron , Nimrod Talmon

In liquid democracy, agents can either vote directly or delegate their vote to a different agent of their choice. This results in a power structure in which certain agents possess more voting weight than others. As a result, it opens up…

Computer Science and Game Theory · Computer Science 2024-10-08 Shiri Alouf-Heffetz , Tanmay Inamdar , Pallavi Jain , Yash More , Nimrod Talmon

We propose a new single-winner voting system using ranked ballots: Stable Voting. The motivating principle of Stable Voting is that if a candidate A would win without another candidate B in the election, and A beats B in a head-to-head…

Theoretical Economics · Economics 2023-02-14 Wesley H. Holliday , Eric Pacuit

Though voting-based consensus algorithms in Blockchain outperform proof-based ones in energy- and transaction-efficiency, they are prone to incur wrong elections and bribery elections. The former originates from the uncertainties of…

Computer Science and Game Theory · Computer Science 2019-12-30 Shengling Wang , Xidi Qu , Qin Hu , Weifeng Lv

The rebellious voter model, introduced by Sturm and Swart (2008), is a variation of the standard, one-dimensional voter model, in which types that are locally in the minority have an advantage. It is related, both through duality and…

Probability · Mathematics 2010-08-17 Jan M. Swart , Karel Vrbensky

Scoring systems are an extremely important class of election systems. We study the complexity of manipulation, constructive control by deleting voters (CCDV), and bribery for scoring systems. For manipulation, we show that for all scoring…

Computational Complexity · Computer Science 2016-04-19 Edith Hemaspaandra , Henning Schnoor

We investigate the problem of computing the probability of winning in an election where voter attendance is uncertain. More precisely, we study the setting where, in addition to a total ordering of the candidates, each voter is associated…

Computer Science and Game Theory · Computer Science 2021-02-01 Aviram Imber , Benny Kimelfeld

Observing electronic voting from an international point of view gives some perspective about its genesis and evolution. An analysis of the voting process through its cultural, ontological, legal and political dimensions explains the…

Computers and Society · Computer Science 2008-12-18 Chantal Enguehard , Jean-Didier Graton

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

We study a two-alternative voting game where voters' preferences depend on an unobservable world state and each voter receives a private signal correlated to the true world state. We consider the collective decision when voters can…

Computer Science and Game Theory · Computer Science 2024-10-11 Xiaotie Deng , Biaoshuai Tao , Ying Wang
‹ Prev 1 8 9 10 Next ›