English
Related papers

Related papers: Election Control by Manipulating Issue Significanc…

200 papers

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

Manipulation is a problem of fundamental importance in the context of voting in which the voters exercise their votes strategically instead of voting honestly to prevent selection of an alternative that is less preferred. The…

Multiagent Systems · Computer Science 2015-02-17 Palash Dey , Neeldhara Misra , Y. Narahari

Strategic manipulation of elections is typically studied in the context of promoting individual candidates. In parliamentary elections, however, the focus shifts: voters may care more about the overall governing coalition than the…

Computer Science and Game Theory · Computer Science 2026-01-13 Hodaya Barr , Eden Hartman , Yonatan Aumann , Sarit Kraus

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

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

The election control problem through social influence asks to find a set of nodes in a social network of voters to be the starters of a political campaign aiming at supporting a given target candidate. Voters reached by the campaign change…

Social and Information Networks · Computer Science 2020-07-14 Mohammad Abouei Mehrizi , Federico Corò , Emilio Cruciani , Gianlorenzo D'Angelo

When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballot and use a voting rule to decide the winning action(s).…

Artificial Intelligence · Computer Science 2012-04-18 Toby Walsh

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 study the election control problem with multi-votes, where each voter can present a single vote according different views (or layers, we use "layer" to represent "view"). For example, according to the attributes of candidates, such as:…

Computational Complexity · Computer Science 2023-07-03 Fengbo Wang , Aizhong Zhou , Jianliang Xu

Strategic voting, or manipulation, is the process by which a voter misrepresents his preferences in an attempt to elect an outcome that he considers preferable to the outcome under sincere voting. It is generally agreed that manipulation is…

Computer Science and Game Theory · Computer Science 2022-11-10 Egor Ianovski , Daria Teplova , Valeriia Kuka

Several elections run in the last years have been characterized by attempts to manipulate the result of the election through the diffusion of fake or malicious news over social networks. This problem has been recognized as a critical issue…

Computer Science and Game Theory · Computer Science 2023-08-22 Vincenzo Auletta , Francesco Carbone , Diodato Ferraioli

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

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

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

We consider the problem of protecting and manipulating elections by recounting and changing ballots, respectively. Our setting involves a plurality-based election held across multiple districts, and the problem formulations are based on the…

Computer Science and Game Theory · Computer Science 2020-11-24 Kishen N. Gowda , Neeldhara Misra , Vraj Patel

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

By the Gibbard--Satterthwaite theorem, every reasonable voting rule for three or more alternatives is susceptible to manipulation: there exist elections where one or more voters can change the election outcome in their favour by…

Computer Science and Game Theory · Computer Science 2017-07-28 Edith Elkind , Umberto Grandi , Francesca Rossi , Arkadii Slinko

Much of the theoretical work on strategic voting makes strong assumptions about what voters know about the voting situation. A strategizing voter is typically assumed to know how other voters will vote and to know the rules of the voting…

Multiagent Systems · Computer Science 2019-07-23 Wesley H. Holliday , Eric Pacuit

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

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