0 voters have participated in this poll.

We make all possible electoral duels between candidates. Candidate A wins his duel against candidate B when a majority of voters prefer candidate A rather than candidate B. The common point of all Condorcet methods is that when a candidate wins all his duels, it is automatically declared winner the election. This case is quite common in practice, so you will notice that often the methods presented here give the same result. These methods may differ in the rare cases where no candidate manages to win all duels.

- Copeland : a candidate wins a point for each duel won and half a point for each tie.
- Simpson (maxmin): The score of a candidate is the score of the worst duel. For example, if his worst result is 35 votes against 65, so his score is 35.

N.B. If a candidate wins all his duels, his score is greater than half the number of voters!.

- Graph: We draw an arrow to each won duel: an arrow of a candidate A to candidate B means that A wins the duel against B, otherwise a majority of voters prefer A rather than B. the thickness of the arrow represents the difference in votes between the two candidates. There is a dotted line if the two candidates are tied.
- Scoring Matrix : Candidate A in line and candidate B in column, the score means the number of voters who prefer candidate A than candidate B

Retrieving data...