Name
Abstract | ||
|---|---|---|
In the late 19th century, Lars Edvard Phragmen proposed a load-balancing approach for selecting committees based on approval ballots. We consider three committee voting rules resulting from this approach: two optimization variants-one minimizing the maximal load and one minimizing the variance of loads-and a sequential variant. We study Phragmen's methods from an axiomatic point of view, focussing on justified representation and related properties that have recently been introduced by Aziz et al. (2015a) and Sanchez-Fernandez et al. (2017). We show that the sequential variant satisfies proportional justified representation, making it the first known polynomial-time computable method with this property. Moreover, we show that the optimization variants satisfy perfect representation. We also analyze the computational complexity of Phragmen's methods and provide mixed- integer programming based algorithms for computing them. |
Year | Venue | Field |
|---|---|---|
2017 | THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE | Voting,Computer science,Cardinal voting systems,Artificial intelligence,Machine learning |
DocType | Citations | PageRank |
Conference | 1 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Markus Brill | 1 | 174 | 19.76 |
| Rupert Freeman | 2 | 46 | 11.45 |
| Svante Janson | 3 | 1009 | 149.67 |
| Martin Lackner | 4 | 40 | 3.98 |