Preferential voting: Difference between revisions
Content added Content deleted
imported>DanBishop No edit summary |
imported>DanBishop m (→Equal rankings) |
||
Line 34: | Line 34: | ||
* Convert the ballot into a fully-ranked one by breaking ties at random. |
* Convert the ballot into a fully-ranked one by breaking ties at random. |
||
* Use fractional votes. If N candidates are tied on a ballot, each candidate receives 1/N of a first-place vote, 1/N of a second-place vote, etc. |
* Use fractional votes. If N candidates are tied on a ballot, each candidate receives 1/N of a first-place vote, 1/N of a second-place vote, etc. |
||
* In most [[Condorcet |
* In most [[Condorcet methods]], the [[defeat strength]] of X over Y can be computed from the X>Y and Y>X votes, while simply ignoring X=Y votes. |
||
==Scope for corruption== |
==Scope for corruption== |