计算社会选择的参数化算法：九个研究挑战
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges
摘要：
计算社会选择是一个跨学科的研究领域，涉及经济学，政治学和社会科学，另一方面，数学和计算机科学（包括人工智能和多智能体系统）。在这一领域研究的典型计算问题包括对攻击的脆弱性投票程序，或在多代理系统的偏好聚合。参数化算法是理论计算机科学的一个分支，它寻求利用有意义的问题特定参数来识别一般计算困难问题的易处理的特殊情况。在本文中，我们提出了九个我们最喜欢的研究挑战，在这种情况下出现的问题的参数化的复杂性。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
