English
Related papers

Related papers: Separating and Collapsing Electoral Control Types

200 papers

We investigate the complexity of {\sc{Constructive Control by Adding/Deleting Votes}} (CCAV/CCDV) for $r$-approval, Condorcet, Maximin and Copeland$^{\alpha}$ in $k$-axes and $k$-candidates partition single-peaked elections. In general, we…

Computer Science and Game Theory · Computer Science 2020-02-11 Yongjie Yang

A core tension in the study of plurality elections is the clash between the classic Hotelling-Downs model, which predicts that two office-seeking candidates should position themselves at the median voter's policy, and the empirical…

Computer Science and Game Theory · Computer Science 2025-03-04 Kiran Tomlinson , Tanvi Namjoshi , Johan Ugander , Jon Kleinberg

When each voter rates or ranks several candidates for a single office, a strong Condorcet winner (SCW) is one who beats all others in two-way races. Among 21 electoral systems examined, 18 will sometimes make candidate X the winner even if…

Methodology · Statistics 2016-09-22 Richard B. Darlington

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

In this paper, we experimentally compare major approval-based multiwinner voting rules. To this end, we define a measure of similarity between two equal-sized committees subject to a given election. Using synthetic elections coming from…

Computer Science and Game Theory · Computer Science 2024-01-23 Piotr Faliszewski , Martin Lackner , Krzysztof Sornat , Stanisław Szufa

We consider distributed elections, where there is a center and $k$ sites. In such distributed elections, each voter has preferences over some set of candidates, and each voter is assigned to exactly one site such that each site is aware…

Computer Science and Game Theory · Computer Science 2019-07-24 Arnold Filtser , Nimrod Talmon

An election over a finite set of candidates is called single-crossing if, as we sweep through the list of voters from left to right, the relative order of every pair of candidates changes at most once. Such elections have many attractive…

Computer Science and Game Theory · Computer Science 2019-06-25 Nathann Cohenn , Edith Elkind , Foram Lakhani

In legal decisions, split votes (SV) occur when judges cannot reach a unanimous decision, posing a difficulty for lawyers who must navigate diverse legal arguments and opinions. In high-stakes domains, understanding the alignment of…

Computation and Language · Computer Science 2024-06-07 Shanshan Xu , T. Y. S. S Santosh , Oana Ichim , Barbara Plank , Matthias Grabmair

In this paper, we discuss a voting model with two candidates, C_1 and C_2. We set two types of voters--herders and independents. The voting of independent voters is based on their fundamental values; on the other hand, the voting of herders…

Physics and Society · Physics 2015-05-27 Masato Hisakado , Shintaro Mori

Electronic voting systems have significant advantages in comparison with physical voting systems. One of the main challenges in e-voting systems is to secure the voting process: namely, to certify that the computed results are consistent…

Cryptography and Security · Computer Science 2025-05-21 Tamir Tassa , Lihi Dery , Arthur Zamarin

Much research in electoral control -- one of the most studied form of electoral attacks, in which an entity running an election alters the structure of that election to yield a preferred outcome -- has focused on giving decision complexity…

Computer Science and Game Theory · Computer Science 2026-05-14 Huy Vu Bui , Michael C. Chavrimootoo , Kien T. Le , Son M. Nguyen

It is important to understand how the outcome of an election can be modified by an agent with control over the structure of the election. Electoral control has been studied for many election systems, but for all studied systems the winner…

Computer Science and Game Theory · Computer Science 2018-11-14 Zack Fitzsimmons , Edith Hemaspaandra , Alexander Hoover , David E. Narváez

Scoring protocols are a broad class of voting systems. Each is defined by a vector $(\alpha_1,\alpha_2,...,\alpha_m)$, $\alpha_1 \geq \alpha_2 \geq >... \geq \alpha_m$, of integers such that each voter contributes $\alpha_1$ points to…

Computer Science and Game Theory · Computer Science 2007-05-23 Edith Hemaspaandra , Lane A. Hemaspaandra

We study the properties of elections that have a given position matrix (in such elections each candidate is ranked on each position by a number of voters specified in the matrix). We show that counting elections that generate a given…

Computer Science and Game Theory · Computer Science 2023-03-10 Niclas Boehmer , Jin-Yi Cai , Piotr Faliszewski , Austen Z. Fan , Łukasz Janeczko , Andrzej Kaczmarczyk , Tomasz Wąs

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

We consider the problem of manipulating elections by cloning candidates. In our model, a manipulator can replace each candidate c by several clones, i.e., new candidates that are so similar to c that each voter simply replaces c in his vote…

Computer Science and Game Theory · Computer Science 2014-01-21 Edith Elkind , Piotr Faliszewski , Arkadii Slinko

In elections, a set of candidates ranked consecutively (though possibly in different order) by all voters is called a clone set, and its members are called clones. A clone structure is a family of all clone sets of a given election. In this…

Computer Science and Game Theory · Computer Science 2011-10-19 Edith Elkind , Piotr Faliszewski , Arkadii Slinko

Democratic societies are built around the principle of free and fair elections, that each citizen's vote should count equal. National elections can be regarded as large-scale social experiments, where people are grouped into usually large…

Physics and Society · Physics 2013-06-28 Peter Klimek , Yuri Yegorov , Rudolf Hanel , Stefan Thurner

In distortion-based analysis of social choice rules over metric spaces, one assumes that all voters and candidates are jointly embedded in a common metric space. Voters rank candidates by non-decreasing distance. The mechanism, receiving…

Computer Science and Game Theory · Computer Science 2019-11-21 David Kempe

In this paper, we discuss a voting model with two candidates, C_0 and C_1. We consider two types of voters--herders and independents. The voting of independents is based on their fundamental values; on the other hand, the voting of herders…

Physics and Society · Physics 2015-03-17 Masato Hisakado , Shintaro Mori