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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Autonomous agents and multi-agent systems Ročník 37; číslo 2; s. 28
Hlavní autori:	Yang, Yongjie, Wang, Jianxin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.12.2023 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!