Approximately Strategy-Proof Voting

@inproceedings{Birrell2011ApproximatelySV,
  title={Approximately Strategy-Proof Voting},
  author={Eleanor Birrell and Rafael Pass},
  booktitle={IJCAI},
  year={2011}
}
The classic Gibbard-Satterthwaite Theorem establishes that only dictatorial voting rules are strategy-proof; under any other voting rule, players have an incentive to lie about their true preferences. We consider a new approach for circumventing this result: we consider randomized voting rules that only approximate a deterministic voting rule and only are approximately strategy-proof. We show that any deterministic voting rule can be approximated by an approximately strategy-proof randomized… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
25 Citations
15 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Strategy-proof voting schemes with continuous preferences

  • S. Barberà, B. Peleg
  • Social Choice and Welfare,
  • 1990
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…