PTAS for minimax approval voting

JarosłLaw Byrka; Krzysztof Sornat

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

PTAS for minimax approval voting

JarosłLaw Byrka, Krzysztof Sornat

Research output: Contribution to journal › Article › peer-review

14 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 language	English
Pages (from-to)	203-217
Number of pages	15
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8877
DOIs	https://doi.org/10.1007/978-3-319-13129-0_15
State	Published - 1 Jan 2014
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

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

Cite this

@article{94dc763a088e4743a07c22e557ec1ab4,

title = "PTAS for minimax approval voting",

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{\textquoteright}10]. The result is obtained by adapting the techniques developed by Li et al. [JACM{\textquoteright}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.",

author = "Jaros{\l}Law Byrka and Krzysztof Sornat",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2014.",

year = "2014",

month = jan,

day = "1",

doi = "10.1007/978-3-319-13129-0_15",

language = "English",

volume = "8877",

pages = "203--217",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

}

TY - JOUR

T1 - PTAS for minimax approval voting

AU - Byrka, JarosłLaw

AU - Sornat, Krzysztof

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84914145949&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-13129-0_15

DO - 10.1007/978-3-319-13129-0_15

M3 - Article

AN - SCOPUS:84914145949

SN - 0302-9743

VL - 8877

SP - 203

EP - 217

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -

PTAS for minimax approval voting

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this