PTAS for Minimax Approval Voting

DOI10.1007/978-3-319-13129-0_15zbMath1406.91102arXiv1407.7216OpenAlexW3103182299MaRDI QIDQ2936986

Krzysztof Sornat, Jaroslaw Byrka

Publication date: 7 January 2015

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.7216

zbMATH Keywords

polynomial time approximation schememinimax approval voting

Mathematics Subject Classification ID

Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items (max. 100)

Finding a collective set of items: from proportional multirepresentation to group recommendation ⋮ Mathematical programming formulations for the efficient solution of the \(k\)-sum approval voting problem ⋮ Justified representation in approval-based committee voting ⋮ Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives ⋮ Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers

This page was built for publication: PTAS for Minimax Approval Voting