English
Related papers

Related papers: Manipulating Elections by Selecting Issues

200 papers

Voting by sequential elimination is a low-communication voting protocol: voters play in sequence and eliminate one or more of the remaining candidates, until only one remains. While the fairness and efficiency of such protocols have been…

Computer Science and Game Theory · Computer Science 2022-10-18 Ulysse Pavloff , Tristan Cazenave , Jérôme Lang

Gerrymandering is a practice of manipulating district boundaries and locations in order to achieve a political advantage for a particular party. Lewenberg, Lev, and Rosenschein [AAMAS 2017] initiated the algorithmic study of a…

Data Structures and Algorithms · Computer Science 2020-02-19 Eduard Eiben , Fedor V. Fomin , Fahad Panolan , Kirill Simonov

We study the following multiagent variant of the knapsack problem. We are given a set of items, a set of voters, and a value of the budget; each item is endowed with a cost and each voter assigns to each item a certain value. The goal is to…

Computer Science and Game Theory · Computer Science 2018-11-14 Till Fluschnik , Piotr Skowron , Mervin Triphaus , Kai Wilker

This research addresses the challenge of conducting interpretable causal inference between a binary treatment and its resulting outcome when not all confounders are known. Confounders are factors that have an influence on both the treatment…

Machine Learning · Computer Science 2023-10-24 Sohaib Kiani , Jared Barton , Jon Sushinsky , Lynda Heimbach , Bo Luo

We consider a social choice problem where only a small number of people out of a large population are sufficiently available or motivated to vote. A common solution to increase participation is to allow voters use a proxy, that is, transfer…

Computer Science and Game Theory · Computer Science 2016-11-28 Gal Cohensius , Shie Manor , Reshef Meir , Eli Meirom , Ariel Orda

The topic of this paper is "gerrymandering", namely the curse of deliberate creations of district maps with highly asymmetric electoral outcomes to disenfranchise voters, and it has a long legal history. Measuring and eliminating…

Computational Complexity · Computer Science 2020-08-05 Tanima Chatterjee , Bhaskar DasGupta

Learning compact and interpretable representations is a very natural task, which has not been solved satisfactorily even for simple binary datasets. In this paper, we review various ways of composing experts for binary data and argue that…

Computer Vision and Pattern Recognition · Computer Science 2016-11-01 Marc Goessling , Yali Amit

We revisit the coalition structure generation problem in which the goal is to partition the players into exhaustive and disjoint coalitions so as to maximize the social welfare. One of our key results is a general polynomial-time algorithm…

Computer Science and Game Theory · Computer Science 2011-06-21 Haris Aziz , Bart de Keijzer

We address the link between the controllability or observability of a stochastic complex system and concepts of information theory. We show that the most influential degrees of freedom can be detected without acting on the system, by…

Systems and Control · Electrical Eng. & Systems 2021-11-11 Pierre-Alain Toupance , Laurent Lefèvre , Bastien Chopard

Climate change, vaccination, abortion, Trump: Many topics are surrounded by fierce controversies. The nature of such heated debates and their elements have been studied extensively in the social science literature. More recently, various…

Computers and Society · Computer Science 2017-08-31 Benjamin Timmermans , Tobias Kuhn , Kaspar Beelen , Lora Aroyo

How does targeted advertising influence electoral outcomes? This paper presents a one-dimensional spatial model of voting in which a privately informed challenger persuades voters to support him over the status quo. I show that targeted…

Theoretical Economics · Economics 2026-01-01 Maria Titova

We study the behavior of Range Voting and Normalized Range Voting with respect to electoral control. Electoral control encompasses attempts from an election chair to alter the structure of an election in order to change the outcome. We show…

Computer Science and Game Theory · Computer Science 2012-06-27 Curtis Menton

We study strategic candidate positioning in multidimensional spatial-voting elections. Voters and candidates are represented as points in $\mathbb{R}^d$, and each voter supports the candidate that is closest under a distance induced by an…

Computer Science and Game Theory · Computer Science 2025-08-20 Colin Cleveland , Bart de Keijzer , Maria Polukarov

Selecting the combination of security controls that will most effectively protect a system's assets is a difficult task. If the wrong controls are selected, the system may be left vulnerable to cyber-attacks that can impact the…

Cryptography and Security · Computer Science 2024-10-31 Dylan Léveillé , Jason Jaskolka

This paper studies binary linear programming problems in the presence of uncertainties that may cause solution values to change during implementation. This type of uncertainty, termed implementation uncertainty, is modeled explicitly…

Optimization and Control · Mathematics 2021-09-29 Jose E. Ramirez-Calderon , V. Jorge Leon

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

Sequential voting rules have played a crucial role in shaping decisions within parliamentary and legislative frameworks. After observing that the existing sequential rules fail several fundamental axioms, Horan and Sprumont [2022] proposed…

Computer Science and Game Theory · Computer Science 2026-03-16 Yongjie Yang

The paper provides an analysis of the voting method known as delegable proxy voting, or liquid democracy. The analysis first positions liquid democracy within the theory of binary aggregation. It then focuses on two issues of the system:…

Multiagent Systems · Computer Science 2017-07-28 Zoé Christoff , Davide Grossi

We present a relation-algebraic model of Condorcet voting and, based on it, relation-algebraic solutions of the constructive control problem via the removal of voters. We consider two winning conditions, viz. to be a Condorcet winner and to…

Computer Science and Game Theory · Computer Science 2013-04-29 Rudolf Berghammer , Henning Schnoor

Schulze's rule is used in the elections of a large number of organizations including Wikimedia and Debian. Part of the reason for its popularity is the large number of axiomatic properties, like monotonicity and Condorcet consistency, which…

Artificial Intelligence · Computer Science 2013-04-04 Serge Gaspers , Thomas Kalinowski , Nina Narodytska , Toby Walsh
‹ Prev 1 8 9 10 Next ›