The computational complexity of the elimination problem in generalized sports competitions

DOI10.1016/J.DISOPT.2003.12.003zbMATH Open1087.90010OpenAlexW2014896310MaRDI QIDQ2386202FDOQ2386202

Authors: Daniël Paulusma, Walter Kern 

Publication date: 22 August 2005

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/the-computational-complexity-of-the-elimination-problem-in-generalized-sports-competitions(6c676c2f-f5fa-457b-be23-6d14ac44ba3c).html

Recommendations

• The new FIFA rules are hard: Complexity aspects of sports competitions.
• Refining the complexity of the sports elimination problem
• The structure and complexity of sports elimination numbers
• CP and MIP approaches for soccer analysis
• This house proves that debating is harder than soccer

zbMATH Keywords

NP-completeNetwork flowElimination problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Possible Winners in Partially Completed Tournaments
• Title not available (Why is that?)
• A new property and a faster algorithm for baseball elimination
• Title not available (Why is that?)
• The new FIFA rules are hard: Complexity aspects of sports competitions.
• The structure and complexity of sports elimination numbers

Cited In (10)

• Soccer is Harder Than Football
• Tournament schedules and incentives in a double round‐robin tournament with four teams
• The new FIFA rules are hard: Complexity aspects of sports competitions.
• The structure and complexity of sports elimination numbers
• Refining the complexity of the sports elimination problem
• On the complexity of bribery and manipulation in tournaments with uncertain information
• A connection between sports and matroids: how many teams can we beat?
• Fixing balanced knockout and double elimination tournaments
• A new property and a faster algorithm for baseball elimination
• Determining the results of tournament games using complete graphs generation

This page was built for publication: The computational complexity of the elimination problem in generalized sports competitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2386202)