Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable

Single-elimination tournaments (or knockout tournaments) are a popular format in sports competitions that is also widely used for decision making and elections. In this paper we study the algorithmic problem of manipulating the outcome of a tournament. More specifically, we study the problem of finding a seeding of the players such that a certain player wins the resulting tournament. The problem is known to be NP-hard in general. In this paper we present an algorithm for this problem that exploits structural restrictions on the tournament. More specifically, we establish that the problem is fixed-parameter tractable when parameterized by the size of a smallest feedback arc set of the tournament (interpreting the tournament as an oriented complete graph). This is a natural parameter because most problems on tournaments (including this one) are either trivial or easily solvable on acyclic tournaments, leading to the question—what about nearly acyclic tournaments or tournaments with a small feedback arc set? Our result significantly improves upon a recent algorithm by Aziz et al. (2014) whose running time is bounded by an exponential function where the size of a smallest feedback arc set appears in the exponent and the base is the number of players.

[1]  Virginia Vassilevska Williams.  Fixing a Tournament , 2010, AAAI.

[2]  Yoav Shoham,et al.  On the complexity of schedule control problems for knockout tournaments , 2009, AAMAS.

[3]  Ravi Kannan,et al.  Minkowski's Convex Body Theorem and Integer Programming , 1987, Math. Oper. Res..

[4]  Virginia Vassilevska Williams,et al.  Fixing Tournaments for Kings, Chokers, and More , 2015, IJCAI.

[5]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[6]  Rolf Niedermeier,et al.  Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective , 2012, The Multivariate Algorithmic Revolution and Beyond.

[7]  Toby Walsh,et al.  h-Index Manipulation by Undoing Merges , 2016, ECAI.

[8]  Isabelle Stanton,et al.  Rigging Tournament Brackets for Weaker Players , 2011, IJCAI.

[9]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[10]  Michael R. Fellows,et al.  Review of: Fundamentals of Parameterized Complexity by Rodney G. Downey and Michael R. Fellows , 2015, SIGA.

[11]  Y. Narahari,et al.  Kernelization complexity of possible winner and coalitional manipulation problems in voting , 2014, Theor. Comput. Sci..

[12]  Warut Suksompong,et al.  Who Can Win a Single-Elimination Tournament? , 2015, AAAI.

[13]  Toby Walsh,et al.  Fixing a Balanced Knockout Tournament , 2014, AAAI.

[14]  Paul D. Seymour,et al.  Tournament pathwidth and topological containment , 2013, J. Comb. Theory, Ser. B.

[15]  Yongjie Yang.  Election Attacks with Few Candidates , 2014, ECAI.

[16]  Piotr Faliszewski,et al.  Elections with Few Voters: Candidate Control Can Be Easy , 2014, AAAI.

[17]  Claudia Lindner,et al.  Fixed-Parameter Tractability and Parameterized Complexity, Applied to Problems From Computational Social Choice — Mathematical Programming Glossary Supplement — , 2008 .

[18]  Michal Pilipczuk,et al.  Parameterized Algorithms , 2015, Springer International Publishing.

[19]  András Frank,et al.  An application of simultaneous diophantine approximation in combinatorial optimization , 1987, Comb..

[20]  A. Cayley.  A theorem on trees , 2009 .