This paper constructs knockout tournament brackets that guarantee the strongest player wins even when up to one third of matches on each path are manipulated, with only a polynomial increase in bracket size.
Tournament qualification, seeding and selection efficiency
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DM 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Tournament Robustness via Redundancy
This paper constructs knockout tournament brackets that guarantee the strongest player wins even when up to one third of matches on each path are manipulated, with only a polynomial increase in bracket size.