Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Introduction to algorithms
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Some simplified NP-complete problems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
ACM Transactions on Algorithms (TALG)
Single-peaked consistency and its complexity
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Complexity of strategic behavior in multi-winner elections
Journal of Artificial Intelligence Research
Multi-winner elections: complexity of manipulation, control, and winner-determination
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Eliciting single-peaked preferences using comparison queries
Journal of Artificial Intelligence Research
Llull and Copeland voting computationally resist bribery and constructive control
Journal of Artificial Intelligence Research
A multivariate complexity analysis of determining possible winners given incomplete votes
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Making decisions based on the preferences of multiple agents
Communications of the ACM
Journal of Computer and System Sciences
On the role of distances in defining voting rules
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Using complexity to protect elections
Communications of the ACM
Aggregating value ranges: preference elicitation and truthfulness
Autonomous Agents and Multi-Agent Systems
Facility location problems: A parameterized view
Discrete Applied Mathematics
The complexity of manipulative attacks in nearly single-peaked electorates
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
On the fixed-parameter tractability of composition-consistent tournament solutions
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
TreeMatrix: A Hybrid Visualization of Compound Graphs
Computer Graphics Forum
Parameterized Complexity
Hi-index | 0.00 |
We investigate two systems of fully proportional representation suggested by Chamberlin & Courant and Monroe. Both systems assign a representative to each voter so that the "sum of misrepresentations" is minimized. The winner determination problem for both systems is known to be NP-hard, hence this work aims at investigating whether there are variants of the proposed rules and/or specific electorates for which these problems can be solved efficiently. As a variation of these rules, instead of minimizing the sum of misrepresentations, we considered minimizing the maximal misrepresentation introducing effectively two new rules. In the general case these "minimax" versions of classical rules appeared to be still NP-hard. We investigated the parameterized complexity of winner determination of the two classical and two new rules with respect to several parameters. Here we have a mixture of positive and negative results: e.g., we proved fixed-parameter tractability for the parameter the number of candidates but fixed-parameter intractability for the number of winners. For single-peaked electorates our results are overwhelmingly positive: we provide polynomial-time algorithms for most of the considered problems. The only rule that remains NP-hard for single-peaked electorates is the classical Monroe rule.