• Corpus ID: 51876173

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

@article{Yang2018ParameterizedCO,
  title={Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability},
  author={Yongjie Yang and Jianxin Wang},
  journal={ArXiv},
  year={2018},
  volume={abs/2107.04685}
}
We study the k -committee selection rules minimax approval, proportional approval, and Chamberlin-Courant's approval. It is known that WINNER DETERMINATION for these rules is NP-hard. Moreover, the parameterized complexity of the problem has also been studied with respect to some natural parameters. However, there are still numerous parameterizations that have not been considered. We revisit the parameterized complexity of WINNER DETERMINATION for these rules by considering several important… 
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules
TLDR
This paper improves the state of the art regarding the computational complexity of computing good committees and considers several utilitarian and egailitarian OWA (ordered weighted average) scoring rules, which are an extensively-researched family of rules (and a subfamily of the family of committee scoring rules).
On the Complexity of Destructive Bribery in Approval-Based Multi-winner Voting
TLDR
This paper explores the complexity of several destructive bribery problems under five prestigious approval-based multi-winner voting rules, and for NP-hard problems the authors study their parameterized complexity with respect to meaningful parameters.
Parameterized Complexity of Committee Elections with Dichotomous and Trichotomous Votes
TLDR
This paper considers the maximin (or egalitarian) variations of the rules, where the minimum satisfaction of the voters is maximized and identifies cases, where trichotomous votes lead to an increase of parameterized complexity.
Multiwinner Voting with Restricted Admissible Sets: Complexity and Strategyproofness
TLDR
Different graph classes G are considered and the complexity of multiwinner determination problem for prevalent voting rules in this setting is investigated and the strategyproofness of many rules for different classes of admissible sets is investigated.
Complexity of Additive Committee Selection with Outliers Extended Abstract
We study the φf -Outliers problem, where we are given an election and are asked whether there are at most n̄ votes whose removal leads to the existence of a k-committee of a desired quality under the
DiRe Committee : Diversity and Representation Constraints in Multiwinner Elections
TLDR
A model, DiRe Committee Winner Determination (DRCWD), is developed, which delineates candidate and voter attributes to select a committee by specifying diversity and representation constraints and a voting rule, and develops a heuristic-based algorithm, which finds the winning DiRe committee in under two minutes.
Approval-Based Committee Voting: Axioms, Algorithms, and Applications
TLDR
This survey summarizes the current understanding of ABC rules from the viewpoint of computational social choice, with main focus on axiomatic analysis, algorithmic results, and relevant applications.
Voting Rules for Expressing Conditional Preferences in Multiwinner Elections
Computational Social Choice studies the aggregation of individual preferences toward a collective decision from an algorithmic point of view. Various problems in multiagent systems, decision making
Parameterized algorithms of fundamental NP-hard problems: a survey
TLDR
This paper gives an overview on parameterized algorithms for some fundamental NP-hard problems, including MaxSAT, Maximum Internal Spanning Trees, maximum Internal Out-Branching, Planar (Connected) Dominating Set, Feedback Vertex Set, Hyperplane Cover, Vertex Cover, Packing and Matching problems.
Fairness in Algorithmic Decision-Making: Applications in Multi-Winner Voting, Machine Learning, and Recommender Systems
TLDR
This study illustrates a multitude of fairness properties studied in these three streams of literature, discuss their commonalities and interrelationships, synthesize what the authors know so far, and provide a useful perspective for future research.

References

SHOWING 1-10 OF 67 REFERENCES
Parameterized Complexity of Winner Determination in Minimax Committee Elections
TLDR
It is proved that on both linear and partial orders, it is W[2]-hard to determine the winners with respect to the size of the committee, and it is shown that in several special settings, the winner determination problem of a minimax approval committee election is polynomial-time solvable.
Single-Peakedness and Total Unimodularity: New Polynomial-Time Algorithms for Multi-Winner Elections
TLDR
This technique gives efficient algorithms for finding optimal committees under Proportional Approval Voting (PAV) and the Chamberlin–Courant rule with single-peaked preferences, as well as for certain OWA-based rules.
On the Complexity of Destructive Bribery in Approval-Based Multi-winner Voting
TLDR
This paper explores the complexity of several destructive bribery problems under five prestigious approval-based multi-winner voting rules, and for NP-hard problems the authors study their parameterized complexity with respect to meaningful parameters.
The control complexity of r-Approval: From the single-peaked case to the general case
TLDR
It turns out that most NP-completeness results in general also hold in k-peaked elections, even for k=2,3, and the problems are studied from the viewpoint of parameterized complexity and achieve both FPT and W-hardness results.
On the Parameterized Complexity of Minimax Approval Voting
TLDR
It is demonstrated that the problem is W[2]-hard when parameterized by the size of the committee to be chosen, but does admit a FPT algorithm when parameterizing by the number of strings that is more efficient than the previous ILP-based approaches for the problem.
Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting
TLDR
It is shown that six prevalent approvalbased multiwinner voting rules generally resist the proposed strategic types and fixed-parameter tractability results for these problems with respect to several natural parameters and derive polynomial-time algorithms for certain special cases.
On the Computation of Fully Proportional Representation
TLDR
This work investigates two systems of fully proportional representation suggested by Chamberlin & Courant and Monroe and investigates the parameterized complexity of winner determination of the two classical and two new rules with respect to several parameters.
Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]
TLDR
This work shows that INDEPENDENT SET is complete for W, and the W Hierarchy of parameterized problems was defined, and complete problems were identified for the classes W [ t ] for t ⩾ 2.
Fixed Parameter Tractability and Completeness
TLDR
It is shown that if Dominating Set is fixed-parameter tractable, then so are a variety of parameterized problems, such as Independent Set, and that for this problem, and for the problem of determining whether a graph has k disjoint cycles, it may take c = 1.
Multi-Winner Elections: Complexity of Manipulation, Control and Winner-Determination
TLDR
This paper fully characterize the worst-case complexity of manipulation and control in the context of four prominent multi-winner voting systems, and shows that several tailor-made multi-winning voting schemes are impractical, as it is NP-hard to select the winners in these schemes.
...
1
2
3
4
5
...