Abstract This paper examines elections among three candidates when the electorate is large and voters can have any of the 26 nontrivial asymmetric binary relations on the candidates as their preference relations. Comparisons are made between rule-λ rankings based on rank-order ballots and simple majorities based on the preference relations. The rule-λ ranking is the decreasing point total order obtained when 1, λ and 0 points are assigned to the candidates ranked first, second and third on each voter's ballot, with 0 ⩽ λ ⩽ 1. Limit probabilities as the number of voters gets large are computed for events such as ‘the first-ranked rule-λ candidate has a majority over the second-ranked rule-λ candidate’ and ‘the rule-λ winner is the Condorcet candidate, given that there is a Condorcet candidate’. The probabilities are expressed as functions of λ and the distribution of voters over types of preference relations. In general, they are maximized at λ = 1/2 (Borda) and minimized at λ = 0 (plurality) and at λ = 1 for any fixed distribution of voters over preference types. The effects of more indifference and increased intransitivity in voter's preference relations are analyzed when λ is fixed.
[1]
D. Slepian.
The one-sided barrier problem for Gaussian noise
,
1962
.
[2]
Peter C. Fishburn,et al.
Robustness of positional scoring over subsets of alternatives
,
1980
.
[3]
Peter C. Fishburn,et al.
The paradox of voting: Effects of individual indifference and intransitivity
,
1980
.
[4]
Peter C. Fishburn,et al.
Coincidence probabilities for simple majority and positional voting rules
,
1978
.
[5]
M. Kendall,et al.
The advanced theory of statistics
,
1945
.
[6]
Ken-ichi Inada,et al.
A Note on the Simple Majority Decision Rule
,
1964
.