Parameterized algorithmics for computational social choice : Nine research challenges

R. Bredereck, J. Chen, P. Faliszewski, J. Guo, R. Niedermeier, G.J. Woeginger

Research output: Book/ReportReportAcademic


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.
Original languageEnglish
Number of pages23
Publication statusPublished - 2014

Publication series

Volume1407.2143 [cs.MA]


Dive into the research topics of 'Parameterized algorithmics for computational social choice : Nine research challenges'. Together they form a unique fingerprint.

Cite this