arrow
返回

Computational Social Choice: Parameterized complexity and challenges

delete2026-02-11
delete0
PRE
AI
J
Jiehua Chen *
C
Christian Hatschka
S
Sofia Simola
DOI:10.1016/j.cosrev.2025.100835delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
我们综述了计算社会选择领域中的两个关键问题——Multi-Winner Determination和Hedonic Games,特别关注它们的参数化复杂性,并提出了该领域的一些研究挑战。
Keyword:
Multi-Winner Determination
Hedonic Games
Parameterized Complexity
Computational Social Choice

期刊

Computer Science Review 封面图
Computer Science Review
IF:
12.7
论文数:
2.3K
被引数:
5.2K

机构

暂无机构信息
引用论文

引用论文

Multivariate Complexity Analysis of Swap Bribery
err2011-09-17
err0
PREAI
errBritta Dorn; Ildikó Schlotter
err分享
err收藏
Multiwinner Rules with Variable Number of Winners
err2020-01-01
err0
PREAI
errFaliszewski Piotr,; Slinko Arkadii,; Talmon Nimrod,
err分享
err收藏
Complexity of Strategic Behavior in Multi-Winner Elections
err2008-09-29
err0
errOAAI
errR. Meir; A. D. Procaccia; J. S. Rosenschein; Aviv Zohar
err分享
err收藏
学者 查看更多内容