Open AccessApproximation and Parameterized Complexity of Minimax Approval Voting
Author(s) -
Marek Cygan,
Łukasz Kowalik,
Arkadiusz Socała,
Krzysztof Sornat
Publication year - 2017
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v31i1.10575
Subject(s) - parameterized complexity , minimax , combinatorics , approval voting , mathematics , time complexity , voting , exponential time hypothesis , matching (statistics) , polynomial time approximation scheme , discrete mathematics , cardinal voting systems , mathematical optimization , statistics , politics , political science , law
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom