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)
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
