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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Autonomous agents and multi-agent systems Jg. 37; H. 2; S. 28
Hauptverfasser:	Yang, Yongjie, Wang, Jianxin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.12.2023 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!