| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 972903 | Mathematical Social Sciences | 2012 | 15 Pages |
Abstract
In voting contexts, some new candidates may show up in the course of the process. In this case, we may want to determine which of the initial candidates are possible winners, given that a fixed number kk of new candidates will be added. We give a computational study of this problem, focusing on scoring rules, and we provide a formal comparison with related problems such as control via adding candidates or cloning.
► We study voting with a dynamic set of candidates. ► We study the possible winner problem upon candidate addition for scoring voting rules. ► We show that some rules allow efficient determination of possible winners, while some other give rise to algorithmically difficult problems.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, Jérôme Monnot, Lirong Xia,