New candidates welcome! Possible winners with respect to the addition of new candidates
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 k 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.
Year of publication: |
2012
|
---|---|
Authors: | Chevaleyre, Yann ; Lang, Jérôme ; Maudet, Nicolas ; Monnot, Jérôme ; Xia, Lirong |
Published in: |
Mathematical Social Sciences. - Elsevier, ISSN 0165-4896. - Vol. 64.2012, 1, p. 74-88
|
Publisher: |
Elsevier |
Saved in:
Saved in favorites
Similar items by person
-
New candidates welcome! : possible winners with respect to the addition of new candidates
Chevaleyre, Yann, (2012)
-
Negotiating over small bundles of resources
Lang, Jérôme, (2005)
-
Compiling the Votes of a Subelectorate
Maudet, Nicolas, (2009)
- More ...