Gehrlein stability in committee selection: parameterized hardness and algorithms
- 24 February 2020
- journal article
- research article
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 34 (1) , 1-21
Abstract
No abstract availableKeywords
Funding Information
- Anusandhan National Research Foundation (PDF/2016/003508)
- Israel Science Foundation (1176/18)
This publication has 17 references indexed in Scilit:
- Kernelization2018
- The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality2017
- Properties of multiwinner voting rulesSocial Choice and Welfare, 2017
- Parameterized Algorithms2015
- Condorcet winning setsSocial Choice and Welfare, 2014
- How hard is it to tell which is a Condorcet committee?Mathematical Social Sciences, 2013
- Improved upper bounds for vertex coverTheoretical Computer Science, 2010
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- An Analysis of Simple Voting Systems for Electing CommitteesSIAM Journal on Applied Mathematics, 1981
- A linear-time approximation algorithm for the weighted vertex cover problemJournal of Algorithms, 1981