Showing cs.GTShow all
2 papers · 1 filter
cs.GT2026
The Complexity of Tournament Fixing: Subset FAS Number and Acyclic Neighborhoods
Yuxi Liu, Junqiang Peng, Mingyu Xiao
The \textsc{Tournament Fixing Problem} (TFP) asks whether a knockout tournament can be scheduled to guarantee that a given player wins. Although TFP is NP-hard in general, it…
cs.GT2026
How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite?
Zhonghao Wang, Junqiang Peng, Yuxi Liu +1
In knockout tournaments, players compete in successive rounds, with losers eliminated and winners advancing until a single champion remains. Given a tournament digraph , which e…