Name
Abstract | ||
|---|---|---|
The Chamberlin-Courant voting rule is an important multiwinner voting rule. Although (mathsf {NP})-hard to compute on general profiles, it is known to be polynomially solvable on single-crossing and single-peaked electorates by exploiting the structures of these domains. We consider the problem of generalizing the domain on which the voting rule admits efficient algorithms. |
Year | Venue | Field |
|---|---|---|
2017 | ADT | Discrete mathematics,Voting,Generalization,Electronic engineering,Mathematics |
DocType | Citations | PageRank |
Conference | 1 | 0.35 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Neeldhara Misra | 1 | 341 | 31.42 |
| Chinmay Sonar | 2 | 1 | 1.03 |
| P. R. Vaidyanathan | 3 | 1 | 0.35 |