@inproceedings{3dcb6c93e3c14d01a31daeb29358d782,
title = "Structured proportional representation",
abstract = "Multi-winner voting rules aiming at proportional representation, such as those suggested by Chamberlin and Courant [9] and by Monroe [20], partition an electorate into virtual districts, such that a representative is assigned to each district; these districts are formed based on the voters' preferences. In some applications it is beneficial to require certain structural properties to be satisfied by these virtual districts. In this paper we consider situations where the voters are embedded in a network, and we require each virtual district to be connected (with respect to the network). We discuss applications of a corresponding combinatorial problem and study its computational complexity, identifying several variants and special eases which can be solved efficiently.",
keywords = "Graph algorithms, Multiwinner elections, Treewidth",
author = "Nimrod Talmon",
note = "Publisher Copyright: {\textcopyright} Copyright 2017, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All Rights Reserved.; 16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017 ; Conference date: 08-05-2017 Through 12-05-2017",
year = "2017",
month = jan,
day = "1",
language = "American English",
series = "Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS",
pages = "633--641",
editor = "Edmund Durfee and Sanmay Das and Kate Larson and Michael Winikoff",
booktitle = "16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017",
}