Fixing balanced knockout and double elimination tournaments
DOI10.1016/j.artint.2018.05.002zbMath1451.68129OpenAlexW2803912439MaRDI QIDQ1711876
Toby Walsh, Paul Stursberg, Haris Aziz, Serge Gaspers, Nicholas Mattei, Simon MacKenzie
Publication date: 18 January 2019
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://zenodo.org/record/3911486
Analysis of algorithms and problem complexity (68Q25) Other game-theoretic models (91A40) Multistage and repeated games (91A20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Cites Work
- Exact exponential algorithms.
- Optimal seedings in elimination tournaments
- On the complexity of bribery and manipulation in tournaments with uncertain information
- Tournament solutions and majority voting
- Prize and incentives in double-elimination tournaments
- Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity?
- The computational complexity of the elimination problem in generalized sports competitions
- The Potts model and the Tutte polynomial
- Determining Possible and Necessary Winners Given Partial Orders
- Manipulating Tournaments in Cup and Round Robin Competitions
- Comparing Draws for Single Elimination Tournaments
- The structure and complexity of sports elimination numbers
This page was built for publication: Fixing balanced knockout and double elimination tournaments