English
Related papers

Related papers: The Complexity of Manipulating $k$-Approval Electi…

200 papers

Aggregating agent preferences into a collective decision is an important step in many problems (e.g., hiring, elections, peer review) and across areas of computer science (e.g., reinforcement learning, recommender systems). As Social Choice…

Multiagent Systems · Computer Science 2025-09-12 Leonardo Matone , Ben Abramowitz , Ben Armstrong , Avinash Balakrishnan , Nicholas Mattei

A variety of constructive manipulation, control, and bribery problems for approval-based multiwinner voting have been extensively studied recently. However, their destructive counterparts seem to be less explored. This paper investigates…

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

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

Elections are the central institution of democratic processes, and often the elected body -- in either public or private governance -- is a committee of individuals. To ensure the legitimacy of elected bodies, the electoral processes should…

Computers and Society · Computer Science 2022-06-01 Florian Evéquoz , Johan Rochel , Vijay Keswani , L. Elisa Celis

The Borda voting rule is a positional scoring rule for $z$ candidates such that in each vote, the first candidate receives $z-1$ points, the second $z-2$ points and so on. The winner in the Borda rule is the candidate with highest total…

Computer Science and Game Theory · Computer Science 2020-10-08 Yiheng Shen , Pingzhong Tang , Yuan Deng

We study electoral campaign management scenarios in which an external party can buy votes, i.e., pay the voters to promote its preferred candidate in their preference rankings. The external party's goal is to make its preferred candidate a…

Computer Science and Game Theory · Computer Science 2010-11-29 Edith Elkind , Piotr Faliszewski

The election, a cornerstone of democracy, is one of the best-recognizable symbols of democratic governance. Voters' confidence in elections is essential, and these days, we can watch practically in live broadcast what consequences distrust…

Cryptography and Security · Computer Science 2024-03-12 Šimon Schierreich

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

We study a temporal voting model where voters have dynamic preferences over a set of public chores -- projects that benefit society, but impose individual costs on those affected by their implementation. We investigate the computational…

Computer Science and Game Theory · Computer Science 2025-08-13 Edith Elkind , Tzeh Yuan Neoh , Nicholas Teh

We investigate the problem of winner determination from computational social choice theory in the data stream model. Specifically, we consider the task of summarizing an arbitrarily ordered stream of $n$ votes on $m$ candidates into a small…

Computational Complexity · Computer Science 2015-09-08 Arnab Bhattacharyya , Palash Dey

We study extensions of the Election Isomorphism problem, focused on the existence of isomorphic subelections. Specifically, we propose the Subelection Isomorphism and the Maximum Common Subelection problems and study their computational…

Computer Science and Game Theory · Computer Science 2021-12-21 Piotr Faliszewski , Krzysztof Sornat , Stanisław Szufa

Preference aggregation in a multiagent setting is a central issue in both human and computer contexts. In this paper, we study in terms of complexity the vulnerability of preference aggregation to destructive control. That is, we study the…

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

Citizen-focused democratic processes where participants deliberate on alternatives and then vote to make the final decision are increasingly popular today. While the computational social choice literature has extensively investigated voting…

Multiagent Systems · Computer Science 2023-05-17 Kanav Mehra , Nanda Kishore Sreenivas , Kate Larson

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

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

Given an election, a preferred candidate p, and a budget, the SHIFT BRIBERY problem asks whether p can win the election after shifting p higher in some voters' preference orders. Of course, shifting comes at a price (depending on the voter…

Artificial Intelligence · Computer Science 2018-09-26 Robert Bredereck , Piotr Faliszewski , Rolf Niedermeier , Nimrod Talmon

We focus on the following natural question: is it possible to influence the outcome of a voting process through the strategic provision of information to voters who update their beliefs rationally? We investigate whether it is…

Computer Science and Game Theory · Computer Science 2019-09-24 Matteo Castiglioni , Andrea Celli , Nicola Gatti

In voting theory, bribery is a form of manipulative behavior in which an external actor (the briber) offers to pay the voters to change their votes in order to get her preferred candidate elected. We investigate a model of bribery where the…

Computer Science and Game Theory · Computer Science 2015-05-13 E. Elkind , P. Faliszewski , A. Slinko

Multi-winner voting is the process of selecting a fixed-size set of representative candidates based on voters' preferences. It occurs in applications ranging from politics (parliamentary elections) to the design of modern computer…

Computer Science and Game Theory · Computer Science 2022-11-22 Martin Lackner , Piotr Skowron

We consider the notions of agreement, diversity, and polarization in ordinal elections (that is, in elections where voters rank the candidates). While (computational) social choice offers good measures of agreement between the voters, such…

Computer Science and Game Theory · Computer Science 2023-05-18 Piotr Faliszewski , Andrzej Kaczmarczyk , Krzysztof Sornat , Stanisław Szufa , Tomasz Wąs