Smallest Tournaments Not Realizable by 23-Majority Voting

@inproceedings{Shepardson2008SmallestTN,
  title={Smallest Tournaments Not Realizable by 23-Majority Voting},
  author={Dylan Shepardson and Craig A. Tovey},
  year={2008}
}
Define the predictability number α(G) of a tournament T to be the largest supermajority threshhold 1 2 < α ≤ 1 for which T could represent the pairwise voting outcomes from some population of voter preference orders. We establish that the predictability number always exists and is rational. Only acyclic tournaments have predictability 1; the Condorcet voting paradox tournament has predictability 2 3 ; Gilboa (4) found a tournament on 54 alternatives (i.e. vertices) that has predictability less… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Combinatorial data: catalogue of nonisomorphic tournaments up to 10 vertices

  • B McKay
  • http://cs.anu.edu.au/ bdm/data/digraphs.html…
  • 2008

Axioms of cooperative decision making

  • H Moulin
  • 1988

Choosing from a tournament

  • H Moulin
  • Soc Choice Welfare
  • 1986

A theorem on the construction of voting paradoxes

  • DC McGarvey
  • Econometrica
  • 1953

Similar Papers

Loading similar papers…