Show simple item record

dc.contributor.authorConitzer, Vincent
dc.contributor.authorLang, Jérôme
dc.contributor.authorXia, Lirong
dc.date.accessioned2010-04-09T10:39:12Z
dc.date.available2010-04-09T10:39:12Z
dc.date.issued2009
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/3899
dc.language.isoenen
dc.subjectVoting
dc.subject.ddc006.3en
dc.subject.classificationjelC60
dc.subject.classificationjelD71
dc.titleHow hard is it to Control Sequential Elections via the Agenda?
dc.typeCommunication / Conférence
dc.description.abstractenVoting on multiple related issues is an importantand difficult problem. The key difficulty is that thenumber of alternatives is exponential in the numberof issues, and hence it is infeasible for the agentsto rank all the alternatives. A simple approach is tovote on the issues one at a time, in sequence; however, a drawback is that the outcome may dependon the order in which the issues are voted upon anddecided, which gives the chairperson some controlover the outcome of the election because she canstrategically determine the order. While this is undeniably a negative feature of sequential voting, inthis paper we temper this judgment by showing thatthe chairperson’s control problem is, in most cases,computationally hard.
dc.identifier.citationpages103-108
dc.relation.ispartoftitleIJCAI-09, 21st International Joint Conference on Artificial Intelligence
dc.relation.ispartofpublnameAAAI Press / IJCAI
dc.relation.ispartofpublcityPalo Alto (USA)
dc.relation.ispartofdate2009
dc.description.sponsorshipprivateouien
dc.subject.ddclabelIntelligence artificielleen
dc.relation.confcountryUNITED STATES
dc.description.ssrncandidatenon
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
dc.date.updated2017-01-06T18:47:08Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record