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 multiagent 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.
| Original language | English |
|---|---|
| Article number | 6867518 |
| Pages (from-to) | 358-373 |
| Number of pages | 16 |
| Journal | Tsinghua Science and Technology |
| Volume | 19 |
| Issue number | 4 |
| DOIs | |
| State | Published - 1 Jan 2014 |
| Externally published | Yes |
Keywords
- NP-hard problems
- cake cutting
- decision making
- exact algorithms
- fixed-parameter tractability
- kernelization
- parameterized complexity
- voting
ASJC Scopus subject areas
- General