PTAS for minimax approval voting

JarosłLaw Byrka, Krzysztof Sornat

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

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.

Original languageEnglish
Pages (from-to)203-217
Number of pages15
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8877
DOIs
StatePublished - 1 Jan 2014
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'PTAS for minimax approval voting'. Together they form a unique fingerprint.

Cite this