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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2025 1verdicts
CONDITIONAL 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.