English
Related papers

Related papers: Measuring Violations of Positive Involvement in Vo…

200 papers

We study the complexity of candidate control in participatory budgeting elections. The goal of constructive candidate control is to ensure that a given candidate wins by either adding or deleting candidates from the election (in the…

Computer Science and Game Theory · Computer Science 2026-01-26 Piotr Faliszewski , Łukasz Janeczko , Dušan Knop , Jan Pokorný , Šimon Schierreich , Mateusz Słuszniak , Krzysztof Sornat

We study the parameterized control complexity of fallback voting, a voting system that combines preference-based with approval voting. Electoral control is one of many different ways for an external agent to tamper with the outcome of an…

Computational Complexity · Computer Science 2010-04-22 Gábor Erdélyi , Michael Fellows

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 positional voting rules when candidates and voters are embedded in a common metric space, and cardinal preferences are naturally given by distances in the metric space. In a positional voting rule, each candidate receives a score…

Computer Science and Game Theory · Computer Science 2017-11-22 Yu Cheng , Shaddin Dughmi , David Kempe

We consider voting rules in settings where voters' identities are difficult to verify. Voters can manipulate the process by casting multiple votes under different identities or abstaining from voting. Immunities to such manipulations are…

Theoretical Economics · Economics 2026-05-15 Agustin G. Bonifacio , Federico Fioravanti

In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the remaining voters are truthful. In this paper, we depart from…

Computer Science and Game Theory · Computer Science 2010-01-28 Yvo Desmedt , Edith Elkind

Predictive mean matching (PMM) is a popular imputation strategy that imputes missing values by borrowing observed values from other cases with similar expectations. We show that, unlike other imputation strategies, PMM is not guaranteed to…

Methodology · Statistics 2025-07-01 Paul T. von Hippel

Integrity of elections is vital to democratic systems, but it is frequently threatened by malicious actors. The study of algorithmic complexity of the problem of manipulating election outcomes by changing its structural features is known as…

Computer Science and Game Theory · Computer Science 2020-07-21 Andrew Estornell , Sanmay Das , Edith Elkind , Yevgeniy Vorobeychik

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

We prove that there is no preferential voting method satisfying the Condorcet winner and loser criteria, positive involvement (if a candidate $x$ wins in an initial preference profile, then adding a voter who ranks $x$ uniquely first cannot…

Theoretical Economics · Economics 2026-02-20 Wesley H. Holliday

We study voting rules with respect to how they allow or limit a majority from dominating minorities: whether a voting rule makes a majority powerful, and whether minorities can veto the candidates they do not prefer. For a given voting…

Computer Science and Game Theory · Computer Science 2022-09-09 Aleksei Y. Kondratev , Alexander S. Nesterov

Electoral control models ways of changing the outcome of an election via such actions as adding/deleting/partitioning either candidates or voters. These actions modify an election's participation structure and aim at either making a…

Computational Complexity · Computer Science 2016-08-14 Gábor Erdélyi , Lena Piras , Jörg Rothe

Voting methods are instrumental design elements of democracies. Citizens use them to express and aggregate their preferences to reach a collective decision. However, voting outcomes can be as sensitive to voting rules as they are to…

In many real world situations, collective decisions are made using voting. Moreover, scenarios such as committee or board elections require voting rules that return multiple winners. In multi-winner approval voting (AV), an agent may vote…

Computer Science and Game Theory · Computer Science 2019-05-31 Jaelle Scheuerman , Jason L. Harman , Nicholas Mattei , K. Brent Venable

Multiwinner voting rules are used to select a small representative subset of candidates or items from a larger set given the preferences of voters. However, if candidates have sensitive attributes such as gender or ethnicity (when selecting…

Computers and Society · Computer Science 2018-06-20 L. Elisa Celis , Lingxiao Huang , Nisheeth K. Vishnoi

We examine vote delegation when preferences of agents are private information. One group of agents (delegators) does not want to participate in voting and abstains under conventional voting or can delegate its votes to the other group…

Computer Science and Game Theory · Computer Science 2021-10-26 Hans Gersbach , Akaki Mamageishvili , Manvir Schneider

The ability to measure the satisfaction of (groups of) voters is a crucial prerequisite for formulating proportionality axioms in approval-based participatory budgeting elections. Two common - but very different - ways to measure the…

Computer Science and Game Theory · Computer Science 2023-10-19 Markus Brill , Stefan Forster , Martin Lackner , Jan Maly , Jannik Peters

In approval-based multiwinner voting, voters express approval preferences over a set of candidates, and the goal is to return a winning committee. This model captures a broad range of subset selection problems under preferences. Prior work…

Computer Science and Game Theory · Computer Science 2026-04-28 Niclas Boehmer , Luca Kreisel , Jannik Peters

We study the voting problem with two alternatives where voters' preferences depend on a not-directly-observable state variable. While equilibria in the one-round voting mechanisms lead to a good decision, they are usually hard to compute…

Computer Science and Game Theory · Computer Science 2025-05-16 Qishen Han , Grant Schoenebeck , Biaoshuai Tao , Lirong Xia

In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal results have shown that all general voting protocols are…

Computer Science and Game Theory · Computer Science 2009-09-29 Vincent Conitzer , Tuomas Sandholm