Proceedings

Fully Proportional Representation as Resource Allocation: Approximability Results

Download BibTeX Cite

Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 353-358.

Abstract

We study the complexity of (approximate) winner determination under Monroe's and Chamberlin-Courant's multiwinner voting rules, where we focus on the total (dis)satisfaction of the voters (the utilitarian case) or the (dis)satisfaction of the worst-off voter (the egalitarian case). We show good approximation algorithms for the satisfaction-based utilitarian cases, and inapproximability results for the remaining settings.

Piotr Krzysztof Skowron, Piotr Faliszewski, and Arkadii M. Slinko. 2013. Fully Proportional Representation as Resource Allocation: Approximability Results. In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13. IJCAI, 353–358. https://ijcai.org/proceedings/2013/60
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards