This House Proves That Debating is Harder Than Soccer

Authors Stefan Neumann, Andreas Wiese

Thumbnail PDF


  • Filesize: 0.51 MB
  • 14 pages

Document Identifiers

Author Details

Stefan Neumann
Andreas Wiese

Cite AsGet BibTex

Stefan Neumann and Andreas Wiese. This House Proves That Debating is Harder Than Soccer. In 8th International Conference on Fun with Algorithms (FUN 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 49, pp. 25:1-25:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


During the last twenty years, a lot of research was conducted on the sport elimination problem: Given a sports league and its remaining matches, we have to decide whether a given team can still possibly win the competition, i.e., place first in the league at the end. Previously, the computational complexity of this problem was investigated only for games with two participating teams per game. In this paper we consider Debating Tournaments and Debating Leagues in the British Parliamentary format, where four teams are participating in each game. We prove that it is NP-hard to decide whether a given team can win a Debating League, even if at most two matches are remaining for each team. This contrasts settings like football where two teams play in each game since there this case is still polynomial time solvable. We prove our result even for a fictitious restricted setting with only three teams per game. On the other hand, for the common setting of Debating Tournaments we show that this problem is fixed parameter tractable if the parameter is the number of remaining rounds k. This also holds for the practically very important question of whether a team can still qualify for the knock-out phase of the tournament and the combined parameter k+b where b denotes the threshold rank for qualifying. Finally, we show that the latter problem is polynomial time solvable for any constant k and arbitrary values b that are part of the input.
  • complexity
  • elimination games
  • soccer
  • debating


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


  1. Mario Basler. Das habe ich ihm dann auch verbal …. Accessed: 2016-04-22. URL:
  2. Thorsten Bernholt, Alexander Gülich, Thomas Hofmeister, and Niels Schmitt. Football elimination is hard to decide under the 3-point-rule. In Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science, MFCS'99, pages 410-418, London, UK, UK, 1999. Springer-Verlag. URL:
  3. Celebrating 200 years of free speech and the art of debating. The Cambridge Union Society. Accessed: 2015-12-18. URL:
  4. Mark Cartwright. Athenian democracy. Ancient History Encyclopedia. Accessed: 2015-12-18. URL:
  5. Katarína Cechlárová, Eva Potpinková, and Ildikó Schlotter. Refining the complexity of the sports elimination problem. Discrete Applied Mathematics, 2015. Google Scholar
  6. Nick Cholst. Why 'three points for a win' is a loss for football - a closer look into one of the most important rule changes in football history. Cafè Futebol. Accessed: 2015-12-18. URL:
  7. Kelly Phillips Erb. Numerous FIFA Officials Arrested in Massive Corruption Scheme Tied to World Cup, Other Tournaments. Forbes. Accessed: 2015-12-18. URL:
  8. Handbook. FIDE. Accessed: 2015-12-18. URL:
  9. 2014 FIFA World Cup reached 3.2 billion viewers, one billion watched final. Fédération Internationale de Football Association. Accessed: 2015-12-18. URL:
  10. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman &Co., New York, NY, USA, 1979. Google Scholar
  11. Gusfield and Martel. The structure and complexity of sports elimination numbers. Algorithmica, 32(1):73-86, 2002. URL:
  12. Marting Luther King Jr. Martin Luther King I Have a Dream Speech. American Rhetoric. Accessed: 2015-12-18. URL:
  13. Walter Kern and Daniël Paulusma. The new FIFA rules are hard: complexity aspects of sports competitions. Discrete Applied Mathematics, 108(3):317-323, 2001. URL:
  14. Walter Kern and Daniël Paulusma. The computational complexity of the elimination problem in generalized sports competitions. Discrete Optimization, 1(2):205-214, 2004. URL:
  15. S. Thomas McCormick. Fast algorithms for parametric scheduling come from extensions to parametric maximum flow. In Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, STOC'96, pages 319-328, New York, NY, USA, 1996. ACM. URL:
  16. Andreas Möller. "Hauptsache Italien!" Legendäre Fußball-Sprüche. tz München. Accessed: 2016-04-22. URL:
  17. Philip Oltermann. Angela Merkel the mascot: German chancellor’s relationship with the team. The Guardian. Accessed: 2015-12-18. URL:
  18. Dömötör Pálvölgyi. Deciding soccer scores and partial orientations of graphs. Acta Univ. Sapientiae, Math, 1(1):35-42, 2009. Google Scholar
  19. Stuart Pearce. Stuart Pearce quotes. Think Exist. Accessed: 2016-04-22. URL:
  20. Ronaldo. Ronaldo quotes. Think Exist. Accessed: 2016-04-22. URL:
  21. B. L. Schwartz. Possible winners in partially completed tournaments. SIAM Review, 8(3):302-308, 1966. URL:
  22. Jürgen Voges. Bundeskanzler: Als Gerhard Schröder noch den Rasen pflügte. Stern. Accessed: 2015-12-18. URL:
  23. Kevin D. Wayne. A new property and a faster algorithm for baseball elimination. SIAM Journal on Discrete Mathematics, 14(2):223-229, 2001. URL:
  24. Rules. World Debating News. Accessed: 2015-12-18. 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