• Corpus ID: 18421552

Asymptotic Collusion-proofness of Voting Rules when the Number of Candidates is Large

@article{Dey2013AsymptoticCO,
  title={Asymptotic Collusion-proofness of Voting Rules when the Number of Candidates is Large},
  author={Palash Dey and Y. Narahari},
  journal={ArXiv},
  year={2013},
  volume={abs/1305.5053}
}
Classical results in voting theory show that strategic manipulation by voters is inevitable if a voting rule simultaneously satisfy certain desirable properties. Motivated by this, we study the relevant question of how often a voting rule is manipulable. It is well known that elections with a large number of voters are rarely manipulable under impartial culture (IC) assumption. However, the manipulability of voting rules when the number of candidates is large has hardly been addressed in the… 

Tables from this paper

References

SHOWING 1-10 OF 13 REFERENCES

Average-case tractability of manipulation in voting via the fraction of manipulators

It is analytically demonstrated that, with respect to a wide range of distributions over votes, the coalitional manipulation problem can be decided with overwhelming probability of success by simply considering the ratio between the number of truthful and untruthful voters.

Manipulation of Voting Schemes: A General Result

It has been conjectured that no system of voting can preclude strategic voting-the securing by a voter of an outcome he prefers through misrepresentation of his preferences. In this paper, for all

Single transferable vote resists strategic voting

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.

Copeland voting: ties matter

This work shows that the problem of manipulation for unweighted Copelandα elections is NP-complete even if the size of the manipulating coalition is limited to two, and is the first one where an election system originally known to be vulnerable to manipulation via a single voter is shown to be resistant to manipulation through a coalition of a constant number of voters.

The vulnerability of point-voting schemes to preference variation and strategic manipulation

AbstractThis essay measures and analyzes for a special class of point-voting schemes (the Borda method, plurality rule and the unrestricted point-voting scheme) sensitivity to preference variation (a

Strategic Voting Without Collusion Under Binary and Democratic Group Decision Rules

The problem of strategic or non-sincere voting has received considerable attention in recent contributions by Murakami [9, pp. 74-81], Farquharson [5], Sen [14, pp. 193-194], Gibbard [6], and

A scheduling approach to coalitional manipulation

This paper solves the coalitional manipulation problem under the important family of positional scoring rules, in an approximate sense, with the following theoretical guarantee: given a manipulable instance with m alternatives, the algorithm finds a successful manipulation with at most m - 2 additional manipulators.

The computational difficulty of manipulating an election

A voting rule is exhibited that efficiently computes winners but is computationally resistant to strategic manipulation, showing how computational complexity might protect the integrity of social choice.

Social Choice Theory and Recommender Systems: Analysis of the Axiomatic Foundations of Collaborative Filtering

This work takes the perspective of CF as a methodology for combining preferences, and demonstrates the impossibility of combining preferences in a way that satisfies several desirable and innocuous-looking properties.