The structure and complexity of sports elimination numbers
From MaRDI portal
Publication:5956833
Recommendations
- A new property and a faster algorithm for baseball elimination
- The computational complexity of the elimination problem in generalized sports competitions
- Refining the complexity of the sports elimination problem
- CP and MIP approaches for soccer analysis
- An application of integer programming to playoff elimination in football championships
Cited in
(11)- A new property and a faster algorithm for baseball elimination
- A multi-agent framework to build integer programming applications to playoff elimination in sports tournaments
- An application of integer programming to playoff elimination in football championships
- Tournament schedules and incentives in a double round‐robin tournament with four teams
- Refining the complexity of the sports elimination problem
- On the complexity of bribery and manipulation in tournaments with uncertain information
- Computing the Number of Winning NFL Survivor Pool Entries
- A connection between sports and matroids: how many teams can we beat?
- The computational complexity of the elimination problem in generalized sports competitions
- Fixing balanced knockout and double elimination tournaments
- This house proves that debating is harder than soccer
This page was built for publication: The structure and complexity of sports elimination numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5956833)