English
Related papers

Related papers: Multiwinner Elections and the Spoiler Effect

200 papers

We extend the recently introduced framework of metric distortion to multiwinner voting. In this framework, $n$ agents and $m$ alternatives are located in an underlying metric space. The exact distances between agents and alternatives are…

Computer Science and Game Theory · Computer Science 2022-02-01 Ioannis Caragiannis , Nisarg Shah , Alexandros A. Voudouris

Election control considers the problem of an adversary who attempts to tamper with a voting process, in order to either ensure that their favored candidate wins (constructive control) or another candidate loses (destructive control). As…

Multiagent Systems · Computer Science 2017-11-27 Bryan Wilder , Yevgeniy Vorobeychik

Online social networks are used to diffuse opinions and ideas among users, enabling a faster communication and a wider audience. The way in which opinions are conditioned by social interactions is usually called social influence. Social…

Social and Information Networks · Computer Science 2019-07-03 Federico Corò , Emilio Cruciani , Gianlorenzo D'Angelo , Stefano Ponziani

We consider the problem of predicting winners in elections, for the case where we are given complete knowledge about all possible candidates, all possible voters (together with their preferences), but where it is uncertain either which…

Computer Science and Game Theory · Computer Science 2016-03-27 Krzysztof Wojtas , Krzysztof Magiera , Tomasz Miąsko , Piotr Faliszewski

We investigate the parameterized complexity of strategic behaviors in generalized scoring rules. In particular, we prove that the manipulation, control (all the 22 standard types), and bribery problems are fixed-parameter tractable for most…

Computer Science and Game Theory · Computer Science 2014-05-27 Yongjie Yang

This article extends the analysis of Atkinson, Foley, and Ganz in "Beyond the Spoiler Effect: Can Ranked-Choice Voting Solve the Problem of Political Polarization?". Their work uses a one-dimensional spatial model based on survey data from…

Instant runoff voting (IRV) is an increasingly-popular alternative to traditional plurality voting in which voters submit rankings over the candidates rather than single votes. In practice, elections using IRV often restrict the ballot…

Multiagent Systems · Computer Science 2022-12-06 Kiran Tomlinson , Johan Ugander , Jon Kleinberg

A key promise of democratic voting is that, by accounting for all constituents' preferences, it produces decisions that benefit the constituency overall. It is alarming, then, that all deterministic voting rules have unbounded distortion:…

Computer Science and Game Theory · Computer Science 2023-05-22 Bailey Flanigan , Ariel D. Procaccia , Sven Wang

This paper is an axiomatic study of consistent approval-based multi-winner rules, i.e., voting rules that select a fixed-size group of candidates based on approval ballots. We introduce the class of counting rules and provide an axiomatic…

Computer Science and Game Theory · Computer Science 2019-11-13 Martin Lackner , Piotr Skowron

In a country with many elections, it may prove economically expedient to hold multiple elections simultaneously on a common polling date. We show that in a polarized society, in which each voter has a preferred party, an increase in the…

Probability · Mathematics 2025-04-29 Pradeep Dubey , Siddhartha Sahi

We introduce two-crossing elections as a generalization of single-crossing elections, showing a number of new results. First, we show that two-crossing elections can be recognized in polynomial time, by reduction to the well-studied…

Computer Science and Game Theory · Computer Science 2022-06-28 Andrei Constantinescu , Roger Wattenhofer

Social networks are increasingly being used to conduct polls. We introduce a simple model of such social polling. We suppose agents vote sequentially, but the order in which agents choose to vote is not necessarily fixed. We also suppose…

Computer Science and Game Theory · Computer Science 2013-02-08 Serge Gaspers , Victor Naroditskiy , Nina Narodytska , Toby Walsh

Voting mechanisms are widely accepted and used methods for decentralized decision-making. Ensuring the acceptance of the voting mechanism's outcome is a crucial characteristic of robust voting systems. Consider this scenario: A group of…

Theoretical Economics · Economics 2024-07-03 Jeremias Lenzi

In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the remaining voters are truthful. In this paper, we depart from…

Computer Science and Game Theory · Computer Science 2010-01-28 Yvo Desmedt , Edith Elkind

We characterise multi-candidate pure-strategy equilibria in the Hotelling-Downs spatial election model for the class of best-worst voting rules, in which each voter is endowed with both a positive and a negative vote, i.e., each voter can…

Computer Science and Game Theory · Computer Science 2016-10-11 Dodge Cahan , Arkadii Slinko

We introduce the model of line-up elections which captures parallel or sequential single-winner elections with a shared candidate pool. The goal of a line-up election is to find a high-quality assignment of a set of candidates to a set of…

Computer Science and Game Theory · Computer Science 2020-07-10 Niclas Boehmer , Robert Bredereck , Piotr Faliszewski , Andrzej Kaczmarczyk , Rolf Niedermeier

We introduce the notion of {\em Distance Restricted Manipulation}, where colluding manipulator(s) need to compute if there exist votes which make their preferred alternative win the election when their knowledge about the others' votes is a…

Computer Science and Game Theory · Computer Science 2020-11-30 Aditya Anand , Palash Dey

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

The proportional veto principle, which captures the idea that a candidate vetoed by a large group of voters should not be chosen, has been studied for ranked ballots in single-winner voting. We introduce a version of this principle for…

Computer Science and Game Theory · Computer Science 2025-05-05 Daniel Halpern , Ariel D. Procaccia , Warut Suksompong

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