Show simple item record

dc.contributor.authorChevaleyre, Yann
dc.contributor.authorLang, Jérôme
dc.contributor.authorMaudet, Nicolas
HAL ID: 4473
ORCID: 0000-0002-4232-069X
dc.contributor.authorMonnot, Jérôme
HAL ID: 178759
ORCID: 0000-0002-7452-6553
dc.contributor.authorXia, Lirong
dc.date.accessioned2012-05-22T16:20:16Z
dc.date.available2012-05-22T16:20:16Z
dc.date.issued2012
dc.identifier.issn0165-4896
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/9264
dc.language.isoenen
dc.subjectcandidates
dc.subjectVote
dc.subjectscoring rules
dc.subjectwinners
dc.subject.ddc006.3en
dc.titleNew candidates welcome! Possible winners with respect to the addition of new candidates
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenIn 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.
dc.relation.isversionofjnlnameMathematical Social Sciences
dc.relation.isversionofjnlvol64
dc.relation.isversionofjnlissue1
dc.relation.isversionofjnldate2012
dc.relation.isversionofjnlpages74-88
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/j.mathsocsci.2011.12.003
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherElsevier
dc.subject.ddclabelIntelligence artificielleen
dc.description.ssrncandidatenon
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
dc.relation.Isversionofjnlpeerreviewedoui
dc.date.updated2017-09-29T16:31:15Z


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record