English
Related papers

Related papers: Manipulation and Control Complexity of Schulze Vot…

200 papers

Today, Internet involves many actors who are making revenues on it (operators, companies, service providers,...). It is therefore important to be able to make fair decisions in this large-scale and highly competitive economical ecosystem.…

Networking and Internet Architecture · Computer Science 2012-05-01 François Durand , Fabien Mathieu , Ludovic Noirie

We introduce a single-winner perspective on voting on matchings, in which voters have preferences over possible matchings in a graph, and the goal is to select a single collectively desirable matching. Unlike in classical matching problems,…

Computer Science and Game Theory · Computer Science 2026-01-28 Niclas Boehmer , Jessica Dierking

We provide an overview of some recent progress on the complexity of election systems. The issues studied include the complexity of the winner, manipulation, bribery, and control problems.

Computer Science and Game Theory · Computer Science 2007-05-23 Piotr Faliszewski , Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

It is important to study how strategic agents can affect the outcome of an election. There has been a long line of research in the computational study of elections on the complexity of manipulative actions such as manipulation and bribery.…

Computer Science and Game Theory · Computer Science 2023-07-24 Zack Fitzsimmons , Edith Hemaspaandra

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

We propose a simple method for combining together voting rules that performs a run-off between the different winners of each voting rule. We prove that this combinator has several good properties. For instance, even if just one of the base…

Artificial Intelligence · Computer Science 2012-03-15 Nina Narodytska , 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

The traditional axiomatic approach to voting is motivated by the problem of reconciling differences in subjective preferences. In contrast, a dominant line of work in the theory of voting over the past 15 years has considered a different…

Discrete Mathematics · Computer Science 2015-12-19 Flavio Chierichetti , Jon Kleinberg

When each voter rates or ranks several candidates for a single office, a strong Condorcet winner (SCW) is one who beats all others in two-way races. Among 21 electoral systems examined, 18 will sometimes make candidate X the winner even if…

Methodology · Statistics 2016-09-22 Richard B. Darlington

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

This paper introduces Propose or Vote (PoV), a democratic procedure for collective decision-making and elections that does not rely on a central mechanism designer. In the first stage, members of a polity choose whether to become…

Theoretical Economics · Economics 2025-12-23 Hans Gersbach

We propose a Condorcet consistent voting method that we call Split Cycle. Split Cycle belongs to the small family of known voting methods satisfying the anti-vote-splitting criterion of independence of clones. In this family, only Split…

Computer Science and Game Theory · Computer Science 2023-11-30 Wesley H. Holliday , Eric Pacuit

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

Control and manipulation are two of the most studied types of attacks on elections. In this paper, we study the complexity of control attacks on elections in which there are manipulators. We study both the case where the "chair" who is…

Computer Science and Game Theory · Computer Science 2017-06-09 Zack Fitzsimmons , Edith Hemaspaandra , Lane A. Hemaspaandra

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

Electoral control models ways of changing the outcome of an election via such actions as adding/deleting/partitioning either candidates or voters. These actions modify an election's participation structure and aim at either making a…

Computational Complexity · Computer Science 2016-08-14 Gábor Erdélyi , Lena Piras , Jörg Rothe

The voting systems known as Alternative Vote (AV) and Single Transferable Vote (STV) are extensively used for elections in Australia, possibly more than in any other jurisdiction. Often proposed as superior alternatives to Plurality and…

Physics and Society · Physics 2025-07-22 Anthony B. Morton

We present theoretical and empirical results demonstrating the usefulness of voting rules for participatory democracies. We first give algorithms which efficiently elicit \epsilon-approximations to two prominent voting rules: the Borda rule…

Multiagent Systems · Computer Science 2014-07-17 David Lee , Ashish Goel , Tanja Aitamurto , Helene Landemore

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

News outlets, surveyors, and other organizations often conduct polls on social networks to gain insights into public opinion. Such a poll is typically started by someone on a social network who sends it to her friends. If a person…

Multiagent Systems · Computer Science 2025-02-05 Koustav De , Palash Dey , Swagato Sanyal