Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective.

Abstract

We review NP-hard voting problems together with their status in terms of parameterized complexity results. In addition, we survey standard techniques for achieving fixed-parameter (in)tractability results in voting.