Parameterized complexity of multiwinner determination: more effort towards fixed-parameter tractability
Auton. Agents Multi Agent Syst.(2023)
摘要
We study the parameterized complexity of winner determination problems for three prevalent k -committee selection rules, namely the minimax approval voting (MAV), the proportional approval voting (PAV), and the Chamberlin–Courant’s approval voting (CCAV). It is known that these problems are computationally hard. Although they have been studied from the parameterized complexity point of view with respect to several natural parameters, many of them turned out to be W[1]-hard or W[2]-hard. Aiming at obtaining plentiful fixed-parameter algorithms, we revisit these problems by considering more natural single parameters, combined parameters, and structural parameters.
更多查看译文
关键词
Multiwinner voting,Fixed-parameter tractability,Minimax approval voting,Proportional approval voting,Chamberlin–Courant’s approval voting,Treewidth,W[1]-hard
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要