DeepAI AI Chat
Log In Sign Up

Approximation and Parameterized Complexity of Minimax Approval Voting

by   Marek Cygan, et al.
Akademia Sztuk Pięknych we Wrocławiu
University of Warsaw

We present three results on the complexity of Minimax Approval Voting. First, we study Minimax Approval Voting parameterized by the Hamming distance d from the solution to the votes. We show Minimax Approval Voting admits no algorithm running in time O^(2^o(d d)), unless the Exponential Time Hypothesis (ETH) fails. This means that the O^(d^2d) algorithm of Misra et al. [AAMAS 2015] is essentially optimal. Motivated by this, we then show a parameterized approximation scheme, running in time O^((3/ϵ)^2d), which is essentially tight assuming ETH. Finally, we get a new polynomial-time randomized approximation scheme for Minimax Approval Voting, which runs in time n^O(1/ϵ^2 ·(1/ϵ))·poly(m), almost matching the running time of the fastest known PTAS for Closest String due to Ma and Sun [SIAM J. Comp. 2009].


page 1

page 2

page 3

page 4


A Parameterized Approximation Scheme for Min k-Cut

In the Min k-Cut problem, input is an edge weighted graph G and an integ...

Are Condorcet and minimax voting systems the best?

In a search for the best voting system for single winner elections with ...

Approximation algorithms for k-median with lower-bound constraints

We study a variant of the classical k-median problem known as diversity-...

On the Parameterized Complexity of Maximum Degree Contraction Problem

In the Maximum Degree Contraction problem, input is a graph G on n verti...

The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality

Understanding the computational complexity of training simple neural net...

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP

We revisit the classic task of finding the shortest tour of n points in ...

Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules

We present an almost optimal algorithm for the classic Chamberlin-Couran...