Parameterized complexity of multiwinner determination: more effort towards fixed-parameter tractability

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 computat...

Full description

Saved in:

Bibliographic Details
Published in:	Autonomous agents and multi-agent systems Vol. 37; no. 2; p. 28
Main Authors:	Yang, Yongjie, Wang, Jianxin
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.12.2023 Springer Nature B.V
Subjects:	Algorithms Artificial Intelligence Candidates Committees Complexity Computer Science Computer Systems Organization and Communication Networks Decision making Elections Graphs Parameterization Parameters Software Engineering/Programming and Operating Systems User Interfaces and Human Computer Interaction Voters W-hard Proportional approval voting Multiwinner voting Chamberlin–Courant’s approval voting Minimax approval voting Fixed-parameter tractability Treewidth
ISSN:	1387-2532, 1573-7454
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!