2014/07/08 by Robert Bredereck, Bredereck, Robert, Jiehua Chen +9
Computer Science · Decision Sciences · Economics, Econometrics and Finance · #Advanced Algebra and Logic #Advanced Graph Theory Research #Auction Theory and Applications #Complexity and Algorithms in Graphs #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Game Theory and Voting Systems #Multiagent Systems (cs.MA)
paper · pdf · doi:10.48550/arxiv.1407.2143
openalex publication_date 2014/07/08 · openalex created_date 2025/10/24 · openalex updated_date 2026/07/28
Computational Social Choice is an interdisciplinary research area involving\nEconomics, Political Science, and Social Science on the one side, and\nMathematics and Computer Science (including Artificial Intelligence and\nMultiagent Systems) on the other side. Typical computational problems studied\nin this field include the vulnerability of voting procedures against attacks,\nor preference aggregation in multi-agent systems. Parameterized Algorithmics is\na subfield of Theoretical Computer Science seeking to exploit meaningful\nproblem-specific parameters in order to identify tractable special cases of in\ngeneral computationally hard problems. In this paper, we propose nine of our\nfavorite research challenges concerning the parameterized complexity of\nproblems appearing in this context.\n