Document Open Access Logo

Condorcet-Consistent and Approximately Strategyproof Tournament Rules

Authors Jon Schneider, Ariel Schvartzman, S. Matthew Weinberg

Thumbnail PDF


  • Filesize: 0.82 MB
  • 20 pages

Document Identifiers

Author Details

Jon Schneider
Ariel Schvartzman
S. Matthew Weinberg

Cite AsGet BibTex

Jon Schneider, Ariel Schvartzman, and S. Matthew Weinberg. Condorcet-Consistent and Approximately Strategyproof Tournament Rules. In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 67, pp. 35:1-35:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)


We consider the manipulability of tournament rules for round-robin tournaments of n competitors. Specifically, n competitors are competing for a prize, and a tournament rule r maps the result of all n(n-1)/2 pairwise matches (called a tournament, T) to a distribution over winners. Rule r is Condorcet-consistent if whenever i wins all n-1 of her matches, r selects i with probability 1. We consider strategic manipulation of tournaments where player j might throw their match to player i in order to increase the likelihood that one of them wins the tournament. Regardless of the reason why j chooses to do this, the potential for manipulation exists as long as Pr[r(T) = i] increases by more than Pr[r(T) = j] decreases. Unfortunately, it is known that every Condorcet-consistent rule is manipulable. In this work, we address the question of how manipulable Condorcet-consistent rules must necessarily be - by trying to minimize the difference between the increase in Pr[r(T) = i] and decrease in Pr[r(T) = j] for any potential manipulating pair. We show that every Condorcet-consistent rule is in fact 1/3-manipulable, and that selecting a winner according to a random single elimination bracket is not alpha-manipulable for any alpha > 1/3. We also show that many previously studied tournament formats are all 1/2-manipulable, and the popular class of Copeland rules (any rule that selects a player with the most wins) are all in fact 1-manipulable, the worst possible. Finally, we consider extensions to match-fixing among sets of more than two players.
  • Tournament design
  • Non-manipulability
  • Condorcet-consistent
  • Strategyproofness


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Alon Altman and Robert Kleinberg. Nonmanipulable randomized tournament selections. In Maria Fox and David Poole, editors, Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15, 2010. AAAI Press, 2010. URL:
  2. Alon Altman, Ariel D. Procaccia, and Moshe Tennenholtz. Nonmanipulable selections from a tournament. In Proceedings of the 21st International Jont Conference on Artifical Intelligence, IJCAI'09, pages 27-32, San Francisco, CA, USA, 2009. Morgan Kaufmann Publishers Inc. URL:
  3. Kenneth J. Arrow. A difficulty in the concept of social welfare. Journal of Political Economy, 58(4):328-346, 1950. URL:
  4. John J. Bartholdi, Craig A. Tovey, and Michael A. Trick. How hard is it to control an election? Mathematical and Computer Modelling, 16(8):27 - 40, 1992. URL:
  5. A.H. Copeland. A 'reasonable' social welfare function. Seminar on Mathematics in Social Sciences, 1951. Google Scholar
  6. S Cox. Tennis match fixing: Evidence of suspected match-fixing revealed, January 2016. URL:
  7. Bhaskar Dutta. Covering sets and a new condorcet choice correspondence. Journal of Economic Theory, 44(1):63 - 80, 1988. URL:
  8. Peter C. Fishburn. Condorcet social choice functions. SIAM Journal on Applied Mathematics, 33(3):469-489, 1977. URL:
  9. Allan Gibbard. Manipulation of voting schemes: a general result. Econometrica, 41(4):587-601, 1973. Google Scholar
  10. Allan Gibbard. Manipulation of schemes that mix voting with chance. Econometrica, 45(3):665-681, 1977. URL:
  11. P Kelso. Badminton pairs expelled from london 2012 olympics after 'match-fixing' scandal, August 2012. URL:
  12. Michael P. Kim, Warut Suksompong, and Virginia Vassilevska Williams. Who can win a single-elimination tournament? In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12-17, 2016, Phoenix, Arizona, USA., pages 516-522, 2016. URL:
  13. Michael P. Kim and Virginia Vassilevska Williams. Fixing tournaments for kings, chokers, and more. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, pages 561-567, 2015. URL:
  14. Jean-Francois Laslier. Tournament solutions and majority voting. Number 7 in Studies in Economic Theory. Springer Verlag, 1997. Google Scholar
  15. H. Moulin. Choosing from a tournament. Social Choice and Welfare, 3(4):271-291, 1986. URL:
  16. Hervé Moulin, Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel D Procaccia. Handbook of Computational Social Choice. Cambridge University Press, 2016. Google Scholar
  17. Marc Pauly. Can strategizing in round-robin subtournaments be avoided? Social Choice and Welfare, 43(1):29-46, 2014. URL:
  18. B Phillips. The tennis triangle, July 2011. URL:
  19. Ronald L. Rivest and Emily Shen. An optimal single-winner preferential voting system based on game theory, 2010. Google Scholar
  20. Ariel Rubinstein. Ranking the participants in a tournament. SIAM Journal on Applied Mathematics, 38(1):108-111, 1980. URL:
  21. Mark Allen Satterthwaite. Strategy-proofness and arrow’s conditions: Existence and correspondence theorems for voting procedures and social welfare functions. Journal of Economic Theory, 10(2):187-217, 1975. Google Scholar
  22. S Scherer. Italy breaks up soccer match-fixing network involving mafia, May 2015. URL:
  23. T. Schwartz. Cyclic tournaments and cooperative majority voting: A solution. Social Choice and Welfare, 7(1):19-29, 1990. URL:
  24. B Sinclair. 12 arrested in esports match fixing scandal - report, October 2015. URL:
  25. R Smyth. World cup: 25 stunning moments ... no3: West germany 1-0 austria in 1982, February 2014. URL:
  26. Isabelle Stanton and Virginia Vassilevska Williams. Rigging tournament brackets for weaker players. In IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011, pages 357-364, 2011. URL:
  27. Thuc Vu, Alon Altman, and Yoav Shoham. On the complexity of schedule control problems for knockout tournaments. In 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), Budapest, Hungary, May 10-15, 2009, Volume 1, pages 225-232, 2009. URL:
  28. H. P. Young. Social choice scoring functions. SIAM Journal on Applied Mathematics, 28(4):824-838, 1975. URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail