On the Parameterized Complexity of Minimax Approval Voting

In this work, we initiate a detailed study of the parameterized complexity of Minimax Approval Voting. We demonstrate that the problem is W[2]-hard when parameterized by the size of the committee to be chosen, but does admit a FPT algorithm when parameterized by the number of strings that is more efficient than the previous ILP-based approaches for the problem. We also consider several combinations of parameters and provide a detailed landscape of the parameterized and kernelization complexity of the problem. We also study the version of the problem where we permit outliers, that is, where the chosen committee is required to satisfy a large number of voters (instead of all of them). In this context, we strengthen an APX-hardness result in the literature, and also show a simple but strong W-hardness result. Categories and Subject Descriptors F.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity; I.2.11 [Artificial Intelligence]: Distributed Artificial Intelligenc...

• Type: Journal
• Year: 2015
• Where: ATAL
• Authors: Neeldhara Misra, Arshed Nabeel, Harman Singh
• Keywords: ATAL 2015, Intelligent Agents