The Complexity of Fully Proportional Representation for Single-Crossing Electorates

4 July 2013

Papers citing "The Complexity of Fully Proportional Representation for Single-Crossing Electorates"

8 / 8 papers shown

Title
Computational Social Choice: Parameterized Complexity and Challenges Jiehua Chena Christian Hatschka Sofia Simola 70 1 0 17 Oct 2024
Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability Yongjie Yang Jian-xin Wang 72 9 0 09 Jul 2021
Election Score Can Be Harder Than Winner Zack Fitzsimmons E. Hemaspaandra 56 2 0 22 Jun 2018
Robustness Among Multiwinner Voting Rules Robert Bredereck Piotr Faliszewski Andrzej Kaczmarczyk R. Niedermeier P. Skowron Nimrod Talmon 94 55 0 05 Jul 2017
Recognizing and Eliciting Weakly Single Crossing Profiles on Trees P. Dey 37 1 0 13 Nov 2016
Justified Representation in Approval-Based Committee Voting Haris Aziz Markus Brill Vincent Conitzer Edith Elkind Rupert Freeman T. Walsh 167 333 0 31 Jul 2014
Finding a Collective Set of Items: From Proportional Multirepresentation to Group Recommendation P. Skowron Piotr Faliszewski J. Lang 143 205 0 13 Feb 2014
Achieving Fully Proportional Representation: Approximability Results P. Skowron Piotr Faliszewski A. Slinko 149 108 0 14 Dec 2013