arXiv · 1407.2143
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges
Abstract
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on the other side. Typical computational problems studied in this field include the vulnerability of voting procedures against attacks, or preference aggregation in multi-agent systems. Parameterized Algorithmics is a subfield of Theoretical Computer Science seeking to exploit meaningful problem-specific parameters in order to identify tractable special cases of in general computationally hard problems. In this paper, we propose nine of our favorite research challenges concerning the parameterized complexity of problems appearing in this context.
Explore related subjects
Keep this discovery
Robert Bredereck, Jiehua Chen, Piotr Faliszewski, Jiong Guo, Rolf Niedermeier, Gerhard J. Woeginger. 2014-07-08. Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges. https://arxiv.org/abs/1407.2143
Cite the original work for its findings. Save a collection to share your selection of sources.