ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1402.0580
  4. Cited By
On the Computation of Fully Proportional Representation

On the Computation of Fully Proportional Representation

4 February 2014
Nadja Betzler
A. Slinko
Johannes Uhlmann
ArXiv (abs)PDFHTML

Papers citing "On the Computation of Fully Proportional Representation"

27 / 27 papers shown
Title
Efficient Algorithms for Electing Successive Committees
Efficient Algorithms for Electing Successive Committees
Pallavi Jain
Andrzej Kaczmarczyk
49
0
0
23 May 2025
Drawing a Map of Elections
Drawing a Map of Elections
Stanisław Szufa
Niclas Boehmer
Robert Bredereck
Piotr Faliszewski
R. Niedermeier
P. Skowron
A. Slinko
Nimrod Talmon
92
0
0
04 Apr 2025
On the Parallelizability of Approval-Based Committee Rules
On the Parallelizability of Approval-Based Committee Rules
Zack Fitzsimmons
Zohair Raza Hassan
E. Hemaspaandra
100
0
0
25 Jan 2025
Computational Social Choice: Parameterized Complexity and Challenges
Computational Social Choice: Parameterized Complexity and Challenges
Jiehua Chena
Christian Hatschka
Sofia Simola
70
1
0
17 Oct 2024
Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules
Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules
Krzysztof Sornat
Virginia Vassilevska Williams
Yinzhan Xu
57
11
0
29 Dec 2022
Indivisible Participatory Budgeting under Weak Rankings
Indivisible Participatory Budgeting under Weak Rankings
Gogulapati Sreedurga
Y. Narahari
37
2
0
16 Jul 2022
Parameterized Intractability for Multi-Winner Election under the
  Chamberlin-Courant Rule and the Monroe Rule
Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule
Jiehua Chen
Sanjukta Roy
44
3
0
24 Feb 2022
Parameterized Complexity of Multi-winner Determination: More Effort
  Towards Fixed-Parameter Tractability
Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability
Yongjie Yang
Jian-xin Wang
72
9
0
09 Jul 2021
Bribery as a Measure of Candidate Success: Complexity Results for
  Approval-Based Multiwinner Rules
Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules
Piotr Faliszewski
P. Skowron
Nimrod Talmon
61
41
0
19 Apr 2021
Fine-Grained Complexity and Algorithms for the Schulze Voting Method
Fine-Grained Complexity and Algorithms for the Schulze Voting Method
Krzysztof Sornat
Virginia Vassilevska Williams
Yinzhan Xu
47
3
0
05 Mar 2021
On the Complexity of Destructive Bribery in Approval-Based Multi-winner Voting
On the Complexity of Destructive Bribery in Approval-Based Multi-winner Voting
Yongjie Yang
125
13
0
03 Feb 2020
Iterative Delegations in Liquid Democracy with Restricted Preferences
Iterative Delegations in Liquid Democracy with Restricted Preferences
B. Escoffier
Hugo Gilbert
Adèle Pass-Lanneau
107
31
0
12 Sep 2018
On Coalitional Manipulation for Multiwinner Elections: Shortlisting
On Coalitional Manipulation for Multiwinner Elections: Shortlisting
Robert Bredereck
Andrzej Kaczmarczyk
R. Niedermeier
59
15
0
27 Jun 2018
Multiwinner Voting with Fairness Constraints
Multiwinner Voting with Fairness Constraints
L. E. Celis
Lingxiao Huang
Nisheeth K. Vishnoi
66
6
0
27 Oct 2017
Robustness Among Multiwinner Voting Rules
Robustness Among Multiwinner Voting Rules
Robert Bredereck
Piotr Faliszewski
Andrzej Kaczmarczyk
R. Niedermeier
P. Skowron
Nimrod Talmon
94
55
0
05 Jul 2017
Proportional Representation in Vote Streams
Proportional Representation in Vote Streams
P. Dey
Nimrod Talmon
Otniel van Handel
69
12
0
28 Feb 2017
What Do We Elect Committees For? A Voting Committee Model for
  Multi-Winner Rules
What Do We Elect Committees For? A Voting Committee Model for Multi-Winner Rules
P. Skowron
69
20
0
21 Nov 2016
Recognizing and Eliciting Weakly Single Crossing Profiles on Trees
Recognizing and Eliciting Weakly Single Crossing Profiles on Trees
P. Dey
33
1
0
13 Nov 2016
Approximation and Parameterized Complexity of Minimax Approval Voting
Approximation and Parameterized Complexity of Minimax Approval Voting
Marek Cygan
Lukasz Kowalik
Arkadiusz Socala
Krzysztof Sornat
59
15
0
26 Jul 2016
Complexity of Shift Bribery in Committee Elections
Complexity of Shift Bribery in Committee Elections
Robert Bredereck
Piotr Faliszewski
R. Niedermeier
Nimrod Talmon
89
45
0
07 Jan 2016
Multi-Attribute Proportional Representation
Multi-Attribute Proportional Representation
J. Lang
P. Skowron
49
54
0
11 Sep 2015
Elections with Few Voters: Candidate Control Can Be Easy
Elections with Few Voters: Candidate Control Can Be Easy
Jiehua Chen
Piotr Faliszewski
R. Niedermeier
Nimrod Talmon
109
65
0
28 Nov 2014
Justified Representation in Approval-Based Committee Voting
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
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
Achieving Fully Proportional Representation: Approximability Results
P. Skowron
Piotr Faliszewski
A. Slinko
141
108
0
14 Dec 2013
The Complexity of Fully Proportional Representation for Single-Crossing
  Electorates
The Complexity of Fully Proportional Representation for Single-Crossing Electorates
P. Skowron
Lan Yu
Piotr Faliszewski
Edith Elkind
102
95
0
04 Jul 2013
Achieving Fully Proportional Representation is Easy in Practice
Achieving Fully Proportional Representation is Easy in Practice
P. Skowron
Piotr Faliszewski
A. Slinko
79
33
0
27 Jan 2013
1