English
Related papers

Related papers: On the Complexity of Destructive Bribery in Approv…

200 papers

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

Multi-winner voting is the process of selecting a fixed-size set of representative candidates based on voters' preferences. It occurs in applications ranging from politics (parliamentary elections) to the design of modern computer…

Computer Science and Game Theory · Computer Science 2022-11-22 Martin Lackner , Piotr Skowron

The Chamberlin-Courant and Monroe rules are fundamental and well-studied rules in the literature of multi-winner elections. The problem of determining if there exists a committee of size k that has a Chamberlin-Courant (respectively,…

Data Structures and Algorithms · Computer Science 2020-04-30 Chinmay Sonar , Palash Dey , Neeldhara Misra

We study the control complexity of fallback voting. Like manipulation and bribery, electoral control describes ways of changing the outcome of an election; unlike manipulation or bribery attempts, control actions---such as…

Computer Science and Game Theory · Computer Science 2010-04-21 Gábor Erdélyi , Lena Piras , Jörg Rothe

Voter control problems model situations in which an external agent tries toaffect the result of an election by adding or deleting the fewest number of voters. The goal of the agent is to make a specific candidate either win…

Multiagent Systems · Computer Science 2017-01-19 Leon Kellerhals , Viatcheslav Korenwein , Philipp Zschoche , Robert Bredereck , Jiehua Chen

We provide an overview of some recent progress on the complexity of election systems. The issues studied include the complexity of the winner, manipulation, bribery, and control problems.

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

Challenge the champ tournaments are one of the simplest forms of competition, where a (initially selected) champ is repeatedly challenged by other players. If a player beats the champ, then that player is considered the new (current) champ.…

Data Structures and Algorithms · Computer Science 2024-03-27 Juhi Chaudhary , Hendrik Molter , Meirav Zehavi

A central theme in computational social choice is to study the extent to which voting systems computationally resist manipulative attacks seeking to influence the outcome of elections, such as manipulation (i.e., strategic voting), control,…

Computer Science and Game Theory · Computer Science 2013-07-30 Piotr Faliszewski , Yannick Reisch , Jörg Rothe , Lena Schend

Judgment aggregation is a framework to aggregate individual opinions on multiple, logically connected issues into a collective outcome. These opinions are cast by judges, which can be for example referees, experts, advisors or jurors,…

Computer Science and Game Theory · Computer Science 2024-04-01 Robert Bredereck , Junjie Luo

Manipulation models for electoral systems are a core research theme in social choice theory; they include bribery (unweighted, weighted, swap, shift, ...), control (by adding or deleting voters or candidates), lobbying in referenda and…

Multiagent Systems · Computer Science 2018-01-30 Dušan Knop , Martin Koutecký , Matthias Mnich

We study approval-based committee voting in which a target number of candidates are selected based on voters' approval preferences over candidates. In contrast to most of the work, we consider the setting where voters express uncertain…

Computer Science and Game Theory · Computer Science 2024-07-30 Hariz Aziz , Venkateswara Rao Kagita , Baharak Rastegari , Mashbat Suzuki

We study the complexity of (approximate) winner determination under the Monroe and Chamberlin--Courant multiwinner voting rules, which determine the set of representatives by optimizing the total (dis)satisfaction of the voters with their…

Artificial Intelligence · Computer Science 2013-12-17 Piotr Skowron , Piotr Faliszewski , Arkadii Slinko

In approval-based committee (ABC) voting, the goal is to choose a subset of predefined size of the candidates based on the voters' approval preferences over the candidates. While this problem has attracted significant attention in recent…

Computer Science and Game Theory · Computer Science 2023-12-15 Martin Bullinger , Chris Dong , Patrick Lederer , Clara Mehler

Given a set of agents qualifying or disqualifying each other, group identification is the task of identifying a socially qualified subgroup of agents. Social qualification depends on the specific rule used to aggregate individual…

Computer Science and Game Theory · Computer Science 2021-05-19 Niclas Boehmer , Robert Bredereck , Dušan Knop , Junjie Luo

This work examines the Conditional Approval Framework for elections involving multiple interdependent issues, specifically focusing on the Conditional Minisum Approval Voting Rule. We first conduct a detailed analysis of the computational…

Computer Science and Game Theory · Computer Science 2025-02-04 Georgios Amanatidis , Michael Lampis , Evangelos Markakis , Georgios Papasotiropoulos

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 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

In the Group Identification problem, we are given a set of individuals and are asked to identify a socially qualified subset among them. Each individual in the set has an opinion about who should be considered socially qualified. There are…

Computer Science and Game Theory · Computer Science 2022-10-03 Emil Junker

Although manipulation and bribery have been extensively studied under weighted voting, there has been almost no work done on election control under weighted voting. This is unfortunate, since weighted voting appears in many important…

Computer Science and Game Theory · Computer Science 2013-05-07 Piotr Faliszewski , Edith Hemaspaandra , Lane A. Hemaspaandra

In voting theory, bribery is a form of manipulative behavior in which an external actor (the briber) offers to pay the voters to change their votes in order to get her preferred candidate elected. We investigate a model of bribery where the…

Computer Science and Game Theory · Computer Science 2015-05-13 E. Elkind , P. Faliszewski , A. Slinko