Approximation and Parameterized Complexity of Minimax Approval Voting

DOI10.1613/jair.1.11253zbMath1451.68130arXiv1607.07906OpenAlexW2903252999WikidataQ128873806 ScholiaQ128873806MaRDI QIDQ4558792

Marek Cygan, Łukasz Kowalik, Arkadiusz Socała, Krzysztof Sornat

Publication date: 30 November 2018

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

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

zbMATH Keywords

approximationcomputational social choicecompitational speed

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Social choice (91B14)

Related Items (2)

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: Approximation and Parameterized Complexity of Minimax Approval Voting