The \textsc{Tournament Fixing} problem asks whether a knockout tournament can be scheduled to make a favorite player win when all pairwise match outcomes are given. Such tournaments are used in sports and provide models for elections and organizational decision-making. Although the problem is NP-hard in general, it is polynomial-time solvable when some structural parameters become zero. Motivated by these cases, we study its parameterized complexity using those structural parameters centered on the favorite player. We prove fixed-parameter tractability when parameterized by either the number of players who beat the favorite player or the number that the favorite player beats. We next consider four subset parameters that measure the arc or vertex deletions needed to eliminate cycles through the player or either neighborhood. For each parameter, the problem remains NP-hard even when its value is one. When both neighborhoods are acyclic, we show that the problem remains NP-hard. We also give some sufficient conditions for the existence of a winning seeding. Our results complete the tractability classification of several individual parameters centered on the favorite player, extending the parameterized complexity landscape of this problem.

翻译：暂无翻译