Possible Winner Problems on Partial Tournaments: A Parameterized Study

We study possible winner problems related to uncovered set and Banks set on partial tournaments from the viewpoint of parameterized complexity. We first study the following problem, where given a partial tournament D and a subset X of vertices, we are asked to add some arcs to D such that all vertices in X are included in the uncovered set. Here we focus on two parameterizations of the problem: parameterized by |X| and parameterized by the number of arcs to be added to make all vertices of X be included in the uncovered set. In addition, we study a parameterized variant of the problem to decide whether we can make all vertices of X be included in the uncovered set by reversing at most k arcs. Finally, we study some parameterizations of a possible winner problem on partial tournaments, where we are given a partial tournament D and a distinguished vertex p, and asked whether D has a maximal transitive subtournament with p being the 0-indegree vertex. These parameterized problems are related to Banks set. For all these parameterized problems studied in this paper, we achieve $\mathcal{XP}$ results, $\mathcal{W}$ -hardness results as well as $\mathcal{FPT}$ results along with a kernelization lower bound.

[1]  R. Downey,et al.  Parameterized Computational Feasibility , 1995 .

[2]  Felix A. Fischer,et al.  Possible and necessary winners of partial tournaments , 2012, AAMAS.

[3]  Olivier Hudry,et al.  A survey on the complexity of tournament solutions , 2009, Math. Soc. Sci..

[4]  Michael R. Fellows,et al.  Parameterized complexity: A framework for systematically confronting computational intractability , 1997, Contemporary Trends in Discrete Mathematics.

[5]  Venkatesh Raman,et al.  Parameterized complexity of the induced subgraph problem in directed graphs , 2007, Inf. Process. Lett..

[6]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[7]  Hans L. Bodlaender,et al.  Kernelization: New Upper and Lower Bound Techniques , 2009, IWPEC.

[8]  J. Banks.  Sophisticated voting outcomes and agenda control , 1984 .

[9]  Rolf Niedermeier,et al.  Invitation to data reduction and problem kernelization , 2007, SIGA.

[10]  P. Fishburn.  Condorcet Social Choice Functions , 1977 .

[11]  Felix A. Fischer,et al.  The Computational Complexity of Choice Sets , 2009, Math. Log. Q..

[12]  Saket Saurabh,et al.  Incompressibility through Colors and IDs , 2009, ICALP.

[13]  H. Landau.  On dominance relations and the structure of animal societies: III The condition for a score structure , 1953 .

[14]  Michael R. Fellows,et al.  On the parameterized complexity of multiple-interval graph problems , 2009, Theor. Comput. Sci..

[15]  Rolf Niedermeier,et al.  Fixed-parameter tractability results for feedback set problems in tournaments , 2006, J. Discrete Algorithms.

[16]  Barry O'Sullivan,et al.  A fixed-parameter algorithm for the directed feedback vertex set problem , 2008, JACM.

[17]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[18]  Gerhard J. Woeginger,et al.  Banks winners in tournaments are difficult to recognize , 2003, Soc. Choice Welf..

[19]  Nicholas R. Miller.  A New Solution Set for Tournaments and Majority Voting: Further Graph- Theoretical Approaches to the Theory of Voting , 1980 .

[20]  Rolf Niedermeier,et al.  Fixed-parameter tractability results for feedback set problems in tournaments , 2010, J. Discrete Algorithms.

[21]  Saket Saurabh,et al.  Parameterized algorithms for feedback set problems and their duals in tournaments , 2006, Theor. Comput. Sci..