Adaptive coalition manipulation in knockout tournaments is hard for every level of the polynomial hierarchy, PSPACE-complete for unbalanced trees, and polynomial-time solvable for constant coalition size.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Adaptive Manipulation for Coalitions in Knockout Tournaments
Adaptive coalition manipulation in knockout tournaments is hard for every level of the polynomial hierarchy, PSPACE-complete for unbalanced trees, and polynomial-time solvable for constant coalition size.