Achieving fully proportional representation is easy in practice

Authors:
Piotr Skowron;Piotr Faliszewski;Arkadii Slinko
Affiliations:
University of Warsaw, Warsaw, Poland;AGH University of Science and Technology, Krakow, Poland;University of Auckland, Auckland, New Zealand
Venue:
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Year:
2013

Citing 4
Cited 2

Nantonac collaborative filtering: recommendation based on order responses

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Complexity of strategic behavior in multi-winner elections

Journal of Artificial Intelligence Research
Where are the hard manipulation problems?

Journal of Artificial Intelligence Research
TreeMatrix: A Hybrid Visualization of Compound Graphs

Computer Graphics Forum

Multi-winner social choice with incomplete preferences

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Fully proportional representation as resource allocation: approximability results

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide experimental evaluation of a number of known and new algorithms for approximate computation of Monroe's and Chamberlin-Courant's rules. Our experiments, conducted both on real-life preference-aggregation data and on synthetic data, show that even very simple and fast algorithms can in many cases find near-perfect solutions. Our results confirm and complement very recent theoretical analysis of Skowron et al., who have shown good lower bounds on the quality of (some of) the algorithms that we study.