Name
Abstract | ||
|---|---|---|
We consider a Plurality-voting scenario, where the candidates are split between parties, and each party nominates exactly one candidate for the final election. We study the computational complexity of deciding if there is a set of nominees such that a candidate from a given party wins in the final election. In our second problem, the goal is to decide if a candidate from a given party always wins, irrespective who is nominated. We show that these problems are computationally hard, but are polynomial-time solvable for restricted settings. |
Year | Venue | Field |
|---|---|---|
2016 | IJCAI | Voting,Blanket primary,Computer science,Computer security,Computational social choice,NOMINATE,Theoretical computer science,Artificial intelligence,Machine learning,Computational complexity theory |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
10 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Piotr Faliszewski | 1 | 1395 | 94.15 |
| Laurent Gourvès | 2 | 241 | 30.97 |
| Jérôme Lang | 3 | 2838 | 260.90 |
| Julien Lesca | 4 | 46 | 8.51 |
| Jérôme Monnot | 5 | 512 | 55.74 |