DeepAI AI Chat
Log In Sign Up

Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability

by   Yongjie Yang, et al.
Central South University

We study winner determination for three prevalent k-committee selection rules, namely minimax approval voting (MAV), proportional approval voting (PAV), and Chamberlin-Courant's approval voting (CCAV). It is known that winner determination for these rules is NP-hard. Parameterized complexity of the problem has been studied with respect to some natural parameters recently. However, there are still numerous parameters that have not been considered. We revisit the parameterized complexity of winner determination by considering several important single parameters, combined parameters, and structural parameters, aiming at detecting more interesting parameters leading to fixed-parameter tractability res


page 1

page 2

page 3

page 4


Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting

We investigate the complexity of several manipulation and control proble...

On Choosing Committees Based on Approval Votes in the Presence of Outliers

We study the computational complexity of committee selection problem for...

Rodent: Relevance determination in ODE

From a set of observed trajectories of a partially observed system, we a...

Beyond the Worst Case: Semi-Random Complexity Analysis of Winner Determination

The computational complexity of winner determination is a classical and ...

The Smoothed Complexity of Computing Kemeny and Slater Rankings

The computational complexity of winner determination under common voting...

Evolutionary design of photometric systems and its application to Gaia

Designing a photometric system to best fulfil a set of scientific goals ...

Fishing out Winners from Vote Streams

We investigate the problem of winner determination from computational so...