For any non-trivial voting system, there exists manipulable situations where a coalition of voters, by casting an insincere ballot, may secure an outcome that is better from their point of view. In this paper, we investigate how it is possible to reduce the manipulability rate, which is the probability of such situations in a given culture, i.e. a probabilistic structure of the population. We prove that when electors are independent, the culture meets a condition that we call decomposability. And when this condition is met, for any voting system that uses more complex ballots than orders of preferences (for example grades), there exists a "reasonable" voting system that depends only on orders of preference and whose manipulability rate is a...
International audienceApproval Voting is known to possess many good properties when voters have dich...
The Condorcet winner in an election is the candidate who would be able to defeat all other candidate...
We study the phase transition of the coalitional manipulation problem for generalized scoring rules....
International audienceWe consider a general framework for voting systems with arbitrary types of bal...
Since any non-trivial voting system is susceptible to manipulation, we investigate how it is possibl...
We study coalitional manipulation of voting systems: can a subset of voters, by voting strategically...
Nous étudions la manipulation par coalition des modes de scrutin: est-ce qu'un sous-ensemble des éle...
This paper attacks a problem like the one addressed in an earlier work (Potthoff, 2013) but is more...
International audienceWe investigate the possibility of designing a voting rule that both meets the ...
Voting rules over three or more alternatives suffer from a general problem of manipulability. Howeve...
Democratic societies base much of their decisions on voting procedures that involve aggregation of i...
International audienceThe Condorcet Efficiency of a voting rule is defined as the conditional probab...
International audienceThe Condorcet winner in an election is the candidate who would be able to defe...
Voting rules over three or more alternatives suffer from a general problem of manipulability. Howeve...
A voting rule is manipulable if it is sometimes possible for a voter to change the election’s outcom...
International audienceApproval Voting is known to possess many good properties when voters have dich...
The Condorcet winner in an election is the candidate who would be able to defeat all other candidate...
We study the phase transition of the coalitional manipulation problem for generalized scoring rules....
International audienceWe consider a general framework for voting systems with arbitrary types of bal...
Since any non-trivial voting system is susceptible to manipulation, we investigate how it is possibl...
We study coalitional manipulation of voting systems: can a subset of voters, by voting strategically...
Nous étudions la manipulation par coalition des modes de scrutin: est-ce qu'un sous-ensemble des éle...
This paper attacks a problem like the one addressed in an earlier work (Potthoff, 2013) but is more...
International audienceWe investigate the possibility of designing a voting rule that both meets the ...
Voting rules over three or more alternatives suffer from a general problem of manipulability. Howeve...
Democratic societies base much of their decisions on voting procedures that involve aggregation of i...
International audienceThe Condorcet Efficiency of a voting rule is defined as the conditional probab...
International audienceThe Condorcet winner in an election is the candidate who would be able to defe...
Voting rules over three or more alternatives suffer from a general problem of manipulability. Howeve...
A voting rule is manipulable if it is sometimes possible for a voter to change the election’s outcom...
International audienceApproval Voting is known to possess many good properties when voters have dich...
The Condorcet winner in an election is the candidate who would be able to defeat all other candidate...
We study the phase transition of the coalitional manipulation problem for generalized scoring rules....