Manipulating Tournaments in Cup and Round Robin Competitions
From MaRDI portal
Publication:3645301
DOI10.1007/978-3-642-04428-1_3zbMath1260.68184arXiv0911.1582OpenAlexW3104355637MaRDI QIDQ3645301
Publication date: 17 November 2009
Published in: Algorithmic Decision Theory (Search for Journal in Brave)
Abstract: In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the most popular types of sporting competitions in polynomial time. In addition, we show that finding the minimal number of games that need to be thrown to manipulate the result can also be determined in polynomial time. Finally, we show that there are several different variations of standard cup competitions where manipulation remains polynomial.
Full work available at URL: https://arxiv.org/abs/0911.1582
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Voting theory (91B12)
Related Items (8)
Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity? ⋮ Tournament solutions based on cooperative game theory ⋮ On the complexity of bribery and manipulation in tournaments with uncertain information ⋮ Fixing balanced knockout and double elimination tournaments ⋮ Is computational complexity a barrier to manipulation? ⋮ Can strategizing in round-robin subtournaments be avoided? ⋮ Margin of victory for tournament solutions ⋮ Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis
This page was built for publication: Manipulating Tournaments in Cup and Round Robin Competitions
