{"type":"ScholarlyArticle","title":"Fully Proportional Representation as Resource Allocation: Approximability Results","authors":[{"name":"Piotr Krzysztof Skowron","slug":"piotr-krzysztof-skowron","given":"Piotr Krzysztof","family":"Skowron","affiliation":""},{"name":"Piotr Faliszewski","slug":"piotr-faliszewski","given":"Piotr","family":"Faliszewski","affiliation":""},{"name":"Arkadii M. Slinko","slug":"arkadii-m-slinko","given":"Arkadii M.","family":"Slinko","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2013/60","pdf":"https://ijcai.org/proceedings/2013/0060.pdf","markdown":"https://ijcai.org/proceedings/2013/60.md","bibtex":"https://ijcai.org/proceedings/2013/bibtex/60","volume":{"slug":"2013","title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2013","url":"https://ijcai.org/proceedings/2013/","year":2013,"location":"Beijing, China","dates":"3–9 August 2013","editors":"Francesca Rossi","isbn":"978-1-57735-633-2","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":60,"pages":{"first":353,"last":358},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}