Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges

doi:10.1109/TST.2014.6867518

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges

2014-08-01

43

OA

AI

DOI：10.1109/TST.2014.6867518

原文链接

查看原文

摘要

En 中文

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. This work is dedicated to Jianer Chen, one of the strongest problem solvers in the history of parameterized algorithmics, on the occasion of his 60th birthday.

Keyword:

NP-hard problems

parameterized complexity

fixed-parameter tractability

kernelization

exact algorithms

voting

decision making

cake cutting

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges

摘要

AI总结

期刊

机构