English
Related papers

Related papers: How Hard Is Bribery in Elections?

200 papers

We investigate how robust approval-based multiwinner voting rules are to small perturbations in the votes. In particular, we consider the extent to which a committee can change after we add/remove/swap one approval, and we consider the…

Computer Science and Game Theory · Computer Science 2026-01-28 Piotr Faliszewski , Grzegorz Gawron , Bartosz Kusek

Fairness in multiwinner elections is studied in varying contexts. For instance, diversity of candidates and representation of voters are both separately termed as being fair. A common denominator to ensure fairness across all such contexts…

Computer Science and Game Theory · Computer Science 2022-11-24 Kunal Relia

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

Motivated by the difficulty of specifying complete ordinal preferences over a large set of $m$ candidates, we study voting rules that are computable by querying voters about $t < m$ candidates. Generalizing prior works that focused on…

Computer Science and Game Theory · Computer Science 2024-09-30 Daniel Halpern , Safwan Hossain , Jamie Tucker-Foltz

Bribe demands present a social conflict scenario where decisions have wide-ranging economic and ethical consequences. Nevertheless, such incidents occur daily in many countries across the globe. Harassment bribery constitute a significant…

Physics and Society · Physics 2018-04-26 Prateek Verma , Anjan K. Nandi , Supratim Sengupta

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

Voting is a general method for preference aggregation in multiagent settings, but seminal results have shown that all (nondictatorial) voting protocols are manipulable. One could try to avoid manipulation by using voting protocols where…

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

In an election, we are given a set of voters, each having a preference list over a set of candidates, that are distributed on a social network. We consider a scenario where voters may change their preference lists as a consequence of the…

Social and Information Networks · Computer Science 2020-06-01 Mohammad Abouei Mehrizi , Gianlorenzo D'Angelo

There is growing evidence of systematic attempts to influence democratic elections by controlled and digitally organized dissemination of fake news. This raises the question of the intrinsic robustness of democratic electoral processes…

Physics and Society · Physics 2024-01-03 Glory M. Givi , Robin Delabays , Matthieu Jacquemet , Philippe Jacquod

In this article, we study the effect of vector-valued interventions in votes under a binary voter model, where each voter expresses their vote as a $0-1$ valued random variable to choose between two candidates. We assume that the outcome is…

Applications · Statistics 2022-10-17 Manit Paul , Rishideep Roy , Soudeep Deb

In a game of persuasion with evidence, a sender has private information. By presenting evidence on the information, the sender wishes to persuade a receiver to take a single action (e.g., hire a job candidate, or convict a defendant). The…

Computer Science and Game Theory · Computer Science 2024-09-10 Martin Hoefer , Pasin Manurangsi , Alexandros Psomas

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

In the United States electoral system, a candidate is elected indirectly by winning a majority of electoral votes cast by individual states, the election usually being decided by the votes cast by a small number of "swing states" where the…

Physics and Society · Physics 2012-11-06 G. C. Levine , B. Caravan , J. E. Cerise

We consider an agent community wishing to decide on several binary issues by means of issue-by-issue majority voting. For each issue and each agent, one of the two options is better than the other. However, some of the agents may be…

Computer Science and Game Theory · Computer Science 2022-07-12 Shiri Alouf-Heffetz , Laurent Bulteau , Edith Elkind , Nimrod Talmon , Nicholas Teh

Preference elicitation is a central problem in AI, and has received significant attention in single-agent settings. It is also a key problem in multiagent systems, but has received little attention here so far. In this setting, the agents…

Computer Science and Game Theory · Computer Science 2007-05-23 Vincent Conitzer , Tuomas Sandholm

We investigate how robust the results of committee elections are to small changes in the input preference orders, depending on the voting rules used. We find that for typical rules the effect of making a single swap of adjacent candidates…

Computer Science and Game Theory · Computer Science 2019-07-24 Robert Bredereck , Piotr Faliszewski , Andrzej Kaczmarczyk , Rolf Niedermeier , Piotr Skowron , Nimrod Talmon

Elections seem simple---aren't they just counting? But they have a unique, challenging combination of security and privacy requirements. The stakes are high; the context is adversarial; the electorate needs to be convinced that the results…

The Possible Winner problem asks, given an election where the voters' preferences over the candidates are specified only partially, whether a designated candidate can become a winner by suitably extending all the votes. Betzler and Dorn [1]…

Computational Complexity · Computer Science 2011-11-29 Dorothea Baumeister , Joerg Rothe

In a party-based election system, the voters are grouped into parties and all voters of a party are assumed to vote according to the party preferences over the candidates. Hence, once the party preferences are declared the outcome of the…

Multiagent Systems · Computer Science 2014-04-10 Jiong Guo , Yash Raj Shrestha , Yongjie Yang

The Coalitional Manipulation (CM) problem has been studied extensively in the literature for many voting rules. The CM problem, however, has been studied only in the complete information setting, that is, when the manipulators know the…

Artificial Intelligence · Computer Science 2015-05-01 Palash Dey , Neeldhara Misra , Y. Narahari