# Bucklin Voting is Broadly Resistant to Control

@article{Erdlyi2010BucklinVI, title={Bucklin Voting is Broadly Resistant to Control}, author={G. Erd{\'e}lyi and Lena Schend and J{\"o}rg Rothe}, journal={ArXiv}, year={2010}, volume={abs/1005.4115} }

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 favorite candidate win ("constructive control") or prevent a despised candidate from winning ("destructive control"), which yields a total of 22 standard control scenarios. To protect elections from such control attempts, computational complexity has been used to…

## Tables from this paper

## 9 Citations

Control Complexity in Bucklin and Fallback Voting

- Computer ScienceArXiv
- 2011

It is shown that fallback voting, an election system proposed by Brams and Sanver to combine Bucklin with approval voting, is resistant to each of the common types of control except to destructive control by either adding or deleting voters.

Normalized Range Voting Broadly Resists Control

- EconomicsTheory of Computing Systems
- 2012

It is shown that Range Voting and Normalized Range Voting has among the largest known number of control resistances among natural voting systems.

Controlling Elections by Replacing Candidates: Theoretical and Experimental Results

- Computer ScienceMPREF@AAAI
- 2014

This study shows that the theoretical computational complexity results are often not reflecting the practical difficulty of controlling elections by replacing candidates, so Plurality and Veto are focused in particular on.

Iterative voting and multi-mode control in preference aggregation

- EconomicsIntelligenza Artificiale
- 2014

This work analyzes two different scenarios, which can be seen as two different sides of the same problem, and usesingle and multiple control actions within iterative voting, in order to understand if the malicious side of control can overcome the stability of the Iterative voting systems.

Multimode Control Attacks on Elections

- Computer ScienceIJCAI
- 2009

This paper model and study the case in which the attacker launches a multipronged (i.e., multimode) attack, and proves that for various election systems even such concerted, flexible attacks can be perfectly planned in deterministic polynomial time.

Controlling elections by replacing candidates for plurality and veto: theoretical and experimental results

- Mathematics
- 2014

We consider elections where the chair may attempt to inuence the result by replacing candidates with the intention to make a specic candidate lose (destructive control). We call this form of control…

The complexity of manipulative attacks in nearly single-peaked electorates

- Political ScienceTARK XIII
- 2011

This paper studies the complexity of manipulative-action algorithms for elections over nearly single-peaked electorates, for various notions of nearness and various election systems.

Comparing State-of-the-Art and Emerging Augmented Reality Interfaces for Autonomous Vehicle-to-Pedestrian Communication

- Computer ScienceIEEE Transactions on Vehicular Technology
- 2021

A comparison of state-of-the-art interfaces and new designs under common conditions is presented, recreating a well-known scenario represented by pedestrians crossing in urban environments under non-regulated conditions.

A semi-supervised domain adaptation assembling approach for image classification

- Computer SciencePattern Analysis and Applications
- 2017

This work proposes depth-based and iterative depth- based fusion methods which are basically rank-based fusion methods and utilize rank of the predicted labels from different classifiers and shows performance improvement over the baseline system, but also over the winner of the ImageCLEF’s 2014 domain adaptation challenge.

## References

SHOWING 1-10 OF 18 REFERENCES

Control Complexity in Fallback Voting

- EconomicsCATS
- 2010

It is shown that fallback voting, an election system combining approval with majority voting, is resistant to each of the 14 common types of candidate control, and also to three types of voter control.

Sincere‐Strategy Preference‐Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control

- EconomicsMath. Log. Q.
- 2009

SP-AV is the second natural voting system with an easy winner-determination procedure that is known to have full resistance to constructive control, and unlike Copeland voting it in addition displays broad resistance to destructive control.

Llull and Copeland Voting Computationally Resist Bribery and Constructive Control

- MathematicsJ. Artif. Intell. Res.
- 2009

Among systems with a polynomial-time winner problem, Copeland voting is the first natural election system proven to have full resistance to constructive control and vulnerability results for microbribery are proven via a novel technique involving min-cost network flow.

Single transferable vote resists strategic voting

- Economics
- 1991

Evidence that Single Tranferable Vote (STV) is computationally resistant to manipulation is given and it is proved that it is NP-complete to recognize when an STV election violates monotonicity, suggesting that non-monotonicity in STV elections might be perceived as less threatening since it is in effect “hidden” and hard to exploit for strategic advantage.

Hybrid Elections Broaden Complexity‐Theoretic Resistance to Control

- Computer ScienceIJCAI
- 2007

Electoral control refers to attempts by an election's organizer (“the chair”) to influence the outcome by adding/deleting/partitioning voters or candidates. The important paper of Bartholdi, Tovey,…

Voting Systems that Combine Approval and Preference

- EconomicsThe Mathematics of Preference, Choice and Order
- 2009

This work proposes a way of combining PAV and FV in two hybrid voting systems, preference approval voting (PAV) and fallback voting (FV), that satisfy several desirable properties, including monotonicity.

When are elections with few candidates hard to manipulate?

- EconomicsJ. ACM
- 2007

This article characterize the exact number of candidates for which manipulation becomes hard for the plurality, Borda, STV, Copeland, maximin, veto, plurality with runoff, regular cup, and randomized cup protocols and shows that for simpler manipulation problems, manipulation cannot be hard with few candidates.

The Complexity of Bribery in Elections

- MathematicsAAAI
- 2006

This work obtains both polynomial-time bribery algorithms and proofs of the intractability of bribery, and results show that the complexity of bribery is extremely sensitive to the setting.