Abstract
AbstractWe 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 computationally hard. Although they have been studied from the parameterized complexity point of view with respect to several natural parameters, many of them turned out to be -hard or -hard. Aiming at obtaining plentiful fixed-parameter algorithms, we revisit these problems by considering more natural single parameters, combined parameters, and structural parameters.
Funder
National Natural Science Foundation of China
Open Project of Xiangjiang Laboratory
Universität des Saarlandes
Publisher
Springer Science and Business Media LLC
Reference81 articles.
1. Agrawal, A., Choudhary, P., Jain, P., Kanesh, L., Sahlot, V., & Saurabh, S. (2018). Hitting and covering partially. In COCOON (pp. 751–763).
2. Aziz, H., Brill, M., Conitzer, V., Elkind, E., Freeman, R., & Walsh, T. (2017). Justified representation in approval-based committee voting. Social Choice and Welfare, 48(2), 461–485.
3. Aziz, H., Gaspers, S., Gudmundsson, J., Mackenzie, S., Mattei, N., & Walsh, T. (2015). Computational aspects of multi-winner approval voting. In AAMAS (pp. 107–115).
4. Betzler, N., Slinko, A., & Uhlmann, J. (2013). On the computation of fully proportional representation. Journal of Artificial Intelligence Research, 47, 475–519.
5. Bläser, M. (2003). Computing small partial coverings. Information Processing Letters, 85(6), 327–331.