English
Related papers

Related papers: The Complexity of Controlling Candidate-Sequential…

200 papers

Previous work on voter control, which refers to situations where a chair seeks to change the outcome of an election by deleting, adding, or partitioning voters, takes for granted that the chair knows all the voters' preferences and that all…

Computer Science and Game Theory · Computer Science 2016-06-20 Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

We study the computational complexity of candidate control in elections with few voters, that is, we consider the parameterized complexity of candidate control in elections with respect to the number of voters as a parameter. We consider…

Artificial Intelligence · Computer Science 2017-03-21 Jiehua Chen , Piotr Faliszewski , Rolf Niedermeier , Nimrod Talmon

Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential, and manipulators may know the already cast votes but may not know the future votes. We…

Computer Science and Game Theory · Computer Science 2013-10-28 Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential, and manipulators may know the already cast votes but may not know the future votes. We…

Computer Science and Game Theory · Computer Science 2015-03-20 Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

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

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

Electoral control refers to attempts by an election's organizer ("the chair") to influence the outcome by adding/deleting/partitioning voters or candidates. The groundbreaking work of Bartholdi, Tovey, and Trick [BTT92] on (constructive)…

Computer Science and Game Theory · Computer Science 2008-09-26 Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

Prior work on the complexity of bribery assumes that the bribery happens simultaneously, and that the briber has full knowledge of all votes. However, in many real-world settings votes come in sequentially, and the briber may have a…

Computer Science and Game Theory · Computer Science 2021-10-26 Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

Prior work on the complexity of bribery assumes that the bribery happens simultaneously, and that the briber has full knowledge of all voters' votes. But neither of those assumptions always holds. In many real-world settings, votes come in…

Computer Science and Game Theory · Computer Science 2021-10-25 Edith Hemaspaandra , Lane A. Hemaspaandra , Jörg Rothe

Control and manipulation are two of the most studied types of attacks on elections. In this paper, we study the complexity of control attacks on elections in which there are manipulators. We study both the case where the "chair" who is…

Computer Science and Game Theory · Computer Science 2017-06-09 Zack Fitzsimmons , Edith Hemaspaandra , Lane A. Hemaspaandra

The integrity of elections is central to democratic systems. However, a myriad of malicious actors aspire to influence election outcomes for financial or political benefit. A common means to such ends is by manipulating perceptions of the…

Computer Science and Game Theory · Computer Science 2022-06-22 Junlin Wu , Andrew Estornell , Lecheng Kong , Yevgeniy Vorobeychik

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

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

Constructive election control considers the problem of an adversary who seeks to sway the outcome of an electoral process in order to ensure that their favored candidate wins. We consider the computational problem of constructive election…

Computer Science and Game Theory · Computer Science 2019-12-02 Jasper Lu , David Kai Zhang , Zinovi Rabinovich , Svetlana Obraztsova , Yevgeniy Vorobeychik

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

The traditional election control problem focuses on the use of control to promote a single candidate. In parliamentary elections, however, the focus shifts: voters care no less about the overall governing coalition than the individual…

Computer Science and Game Theory · Computer Science 2025-03-07 Hodaya Barr , Eden Hartman , Yonatan Aumann , Sarit Kraus

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

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

The successive and the amendment procedures have been widely employed in parliamentary and legislative decision making and have undergone extensive study in the literature from various perspectives. However, investigating them through the…

Computer Science and Game Theory · Computer Science 2025-03-19 Yongjie Yang

Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating together preferences of multiple agents. We study here the…

Artificial Intelligence · Computer Science 2012-04-18 Toby Walsh
‹ Prev 1 2 3 10 Next ›