Who Can Win a Single-Elimination Tournament?

DOI10.1137/16M1061783zbMath1406.91005arXiv1511.08416WikidataQ56031307 ScholiaQ56031307MaRDI QIDQ5348496

Michael P. Kim, Warut Suksompong, Virginia Vassilevska Williams

Publication date: 18 August 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.08416

zbMATH Keywords

manipulationsports schedulingknockout tournamentsingle-elimination tournament

Mathematics Subject Classification ID

2-person games (91A05) Social choice (91B14)

Related Items (11)

Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity? ⋮ Condorcet-consistent and approximately strategyproof tournament rules ⋮ Fixing knockout tournaments with seeds ⋮ Query complexity of tournament solutions ⋮ Tight bounds on 3-team manipulations in randomized death match ⋮ Single-Elimination Brackets Fail to Approximate Copeland Winner. ⋮ Robust bounds on choosing from large tournaments ⋮ Margin of victory for tournament solutions ⋮ Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis ⋮ Robust bounds on choosing from large tournaments ⋮ Knockout-Tournament Procedures for Large-Scale Ranking and Selection in Parallel Computing Environments

Cites Work

• Unnamed Item
• On the complexity of bribery and manipulation in tournaments with uncertain information
• Choosing from a large tournament
• The bipartisan set of a tournament game
• Tournament solutions and majority voting
• Fixing balanced knockout and double elimination tournaments
• Tournament Solutions

This page was built for publication: Who Can Win a Single-Elimination Tournament?