---
title: "Fully Proportional Representation as Resource Allocation: Approximability Results"
authors:
  - "Piotr Krzysztof Skowron"
  - "Piotr Faliszewski"
  - "Arkadii M. Slinko"
doi: ""
url: "https://ijcai.org/proceedings/2013/60"
pdf: "https://ijcai.org/proceedings/2013/0060.pdf"
venue: "Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence"
year: 2013
pages: "353-358"
track: ""
keywords:
---

# Fully Proportional Representation as Resource Allocation: Approximability Results

Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko

*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.