The structure and complexity of sports elimination numbers

DOI10.1007/S00453-001-0074-YMaRDI QIDQ5956833zbMATH OpenOpenAlexFDO

Authors Dan Gusfield, Chip Martel

Publication date 28 February 2002

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0074-y

zbMATH Keywords

combinatorial optimizationnetwork flow

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

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)