Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules

DOI10.1007/s00453-023-01155-7MaRDI QIDQ6066767

Sushmita Gupta, Nimrod Talmon, Saket Saurabh, Pallavi Jain

Publication date: 13 December 2023

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

Parameterized complexityChamberlin Courantmultiwinner election

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Finding a collective set of items: from proportional multirepresentation to group recommendation
• Fundamentals of parameterized complexity
• Exact and approximate bandwidth
• Dynamic programming based algorithms for set multicover and multiset multicover problems
• Axiomatic characterization of committee scoring rules
• Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives
• Properties of multiwinner voting rules
• On the Computation of Fully Proportional Representation
• Studies in Computational Aspects of Voting
• Fixed-Parameter Tractability and Completeness I: Basic Results
• Isomorphic Distances Among Elections
• Parameterized Algorithms
• Robustness among multiwinner voting rules
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules