z-logo
open-access-imgOpen Access
Possible Winners in Approval Voting
Author(s) -
Nathanaël Barrot,
Laurent Gourvès,
Jérôme Lang,
Jérôme Monnot,
Bernard Ries
Publication year - 2013
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
DOI - 10.1007/978-3-642-41575-3_5
Subject(s) - voting , approval voting , set (abstract data type) , computer science , outcome (game theory) , probability distribution , mathematical economics , distribution (mathematics) , bounded function , cardinal voting systems , mathematics , statistics , law , political science , mathematical analysis , politics , programming language
International audienceGiven the knowledge of the preferences of a set of voters over a set of candidates, and assuming that voters cast sincere approval ballots, what can we say about the possible (co-)winners? The outcome depends on the number of candidates each voter will approve. Whereas it is easy to know who can be a unique winner, we show that deciding whether a set of at least two candidates can be the set of co-winners is computationally hard. If, in addition, we have a probability distribution over the number of candidates approved by each voter, we obtain a probability distribution over winners; we study the shape of this probability distribution empirically, for the impartial culture assumption. We study variants of the problem where the number of candidates approved by each voter is upper and/or lower bounded. We generalize some of our results to multiwinner approval voting

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom