Approximation and Parameterized Complexity of Minimax Approval Voting

DOI10.1613/jair.1.11253zbMath1451.68130arXiv1607.07906MaRDI 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

approximation; computational social choice; compitational speed

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms

91B14: Social choice