PTAS for Minimax Approval Voting

  • Jarosław Byrka
  • Krzysztof Sornat
Conference paper

DOI: 10.1007/978-3-319-13129-0_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8877)
Cite this paper as:
Byrka J., Sornat K. (2014) PTAS for Minimax Approval Voting. In: Liu TY., Qi Q., Ye Y. (eds) Web and Internet Economics. WINE 2014. Lecture Notes in Computer Science, vol 8877. Springer, Cham

Abstract

We consider Approval Voting systems where each voter decides on a subset of candidates he/she approves. We focus on the optimization problem of finding the committee of fixed size k, minimizing the maximal Hamming distance from a vote. In this paper we give a PTAS for this problem and hence resolve the open question raised by Carragianis et al. [AAAI’10]. The result is obtained by adapting the techniques developed by Li et al. [JACM’02] originally used for the less constrained Closest String problem. The technique relies on extracting information and structural properties of constant size subsets of votes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Jarosław Byrka
    • 1
  • Krzysztof Sornat
    • 1
  1. 1.Institute of Computer ScienceUniversity of WrocławWrocławPoland

Personalised recommendations