Skip to main content
Top
Published in: Social Choice and Welfare 1/2014

01-06-2014 | Original Paper

Can strategizing in round-robin subtournaments be avoided?

Author: Marc Pauly

Published in: Social Choice and Welfare | Issue 1/2014

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This paper develops a mathematical model of strategic manipulation in complex sports competition formats such as the soccer world cup or the Olympic games. Strategic manipulation refers here to the possibility that a team may lose a match on purpose in order to increase its prospects of winning the competition. In particular, the paper looks at round-robin tournaments where both first- and second-ranked players proceed to the next round. This standard format used in many sports gives rise to the possibility of strategic manipulation, as exhibited recently in the 2012 Olympic games. An impossibility theorem is proved which demonstrates that under a number of reasonable side-constraints, strategy-proofness is impossible to obtain.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Appendix
Available only for authorised users
Literature
go back to reference Altman A, Klienberg R (2010) Nonmanipulable randomized tournament selections. In: Proceedings of AAAI-10. AAAI Press, Menlo Park, pp 686–690 Altman A, Klienberg R (2010) Nonmanipulable randomized tournament selections. In: Proceedings of AAAI-10. AAAI Press, Menlo Park, pp 686–690
go back to reference Altman A, Procaccia A, Tennenholtz M (2009) Nonmanipulable selections from a tournament. In: Proceedings of IJCAI’09. Morgan Kaufmann Publishers, San Francisco, pp 27–32 Altman A, Procaccia A, Tennenholtz M (2009) Nonmanipulable selections from a tournament. In: Proceedings of IJCAI’09. Morgan Kaufmann Publishers, San Francisco, pp 27–32
go back to reference Appel K, Haken W (1977) Every planar map is four colorable. Part I. Discharging. Ill J Math 21:429–490 Appel K, Haken W (1977) Every planar map is four colorable. Part I. Discharging. Ill J Math 21:429–490
go back to reference Appel K, Haken W, Koch J (1977) Every planar map is four colorable. Part II. Reducibility. Ill J Math 21:491–567 Appel K, Haken W, Koch J (1977) Every planar map is four colorable. Part II. Reducibility. Ill J Math 21:491–567
go back to reference Dillman L (2012) London olympics: badminton scandal rocks sport; 8 players expelled. Los Angel Times (Internet Ed) 1 Aug 2012 (consulted on 12 Dec 2012) Dillman L (2012) London olympics: badminton scandal rocks sport; 8 players expelled. Los Angel Times (Internet Ed) 1 Aug 2012 (consulted on 12 Dec 2012)
go back to reference Gonthier G (2008) Formal proof—the four-color theorem. Notices Am Math Soc 55(11):1382–1393 Gonthier G (2008) Formal proof—the four-color theorem. Notices Am Math Soc 55(11):1382–1393
go back to reference Hudry O (2009) A survey on the complexity of tournament solutions. Math Soc Sci 57:292–303CrossRef Hudry O (2009) A survey on the complexity of tournament solutions. Math Soc Sci 57:292–303CrossRef
go back to reference Laslier JF (1997) Tournament solutions and majority voting. Springer, HeidelbergCrossRef Laslier JF (1997) Tournament solutions and majority voting. Springer, HeidelbergCrossRef
go back to reference MacKenzie D (2001) Mechanizing proof: computing, risk and trust. MIT Press, Cambridge MacKenzie D (2001) Mechanizing proof: computing, risk and trust. MIT Press, Cambridge
go back to reference Peris JE, Subiza B (1999) Condorcet choice correspondences for weak tournaments. Soc Choice Welf 16:217–231CrossRef Peris JE, Subiza B (1999) Condorcet choice correspondences for weak tournaments. Soc Choice Welf 16:217–231CrossRef
go back to reference Rubinstein A (1980) Ranking the participants in a tournament. SIAM J Appl Math 38(1):108–111CrossRef Rubinstein A (1980) Ranking the participants in a tournament. SIAM J Appl Math 38(1):108–111CrossRef
go back to reference Russell T, Walsh T (2009) Manipulating tournaments in cup and round robin competitions. In: Rossi F, Tsoukias A (eds) Algorithmic decision theory: first international conference, ADT 2009. Springer, Berlin, pp 26–37 Russell T, Walsh T (2009) Manipulating tournaments in cup and round robin competitions. In: Rossi F, Tsoukias A (eds) Algorithmic decision theory: first international conference, ADT 2009. Springer, Berlin, pp 26–37
Metadata
Title
Can strategizing in round-robin subtournaments be avoided?
Author
Marc Pauly
Publication date
01-06-2014
Publisher
Springer Berlin Heidelberg
Published in
Social Choice and Welfare / Issue 1/2014
Print ISSN: 0176-1714
Electronic ISSN: 1432-217X
DOI
https://doi.org/10.1007/s00355-013-0767-6

Other articles of this Issue 1/2014

Social Choice and Welfare 1/2014 Go to the issue