Directory UMM :Data Elmu:jurnal:M:Mathematical Social Sciences:Vol41.Issue1.Jan2001:

www.elsevier.nl / locate / econbase

The Condorcet efficiency of Borda Rule with anonymous

voters

a ,_* b

William V. Gehrlein , Dominique Lepelley

a

Department of Business Administration, University of Delaware, Newark, DE 19716, USA b

University of Caen, Caen, France

Received 23 October 1998; received in revised form 10 December 1999; accepted 13 January 2000 Abstract

The Condorcet winner in an election is the candidate that would be able to defeat each of the other candidates in a series of pairwise elections. The Condorcet efficiency of a voting rule is the conditional probability that it would elect the Condorcet winner, given that a Condorcet winner exists. A closed form representation is obtained for the Condorcet efficiency of Borda Rule in three candidate elections under the impartial anonymous culture condition.  2001 Elsevier Science B.V. All rights reserved.

Keywords: Condorcet efficiency; Borda Rule JEL classification: D72

1. Introduction

We wish to consider elections on three candidates [A, B, C]. There are six possible complete preference rankings that voters might have on these candidates:

A A B C B C

B C A A C B

C B C B A A

n1 n2 n3 n4 n5 n6

Since only complete preference rankings are considered, there is no voter indifference between candidates. The n ’s refer to the specific number of voters who have thei *Corresponding author. Tel.:1_{1-302-831-1767; fax:}1_{1-302-831-4196.}

E-mail address: wvg@udel.edu (W.V. Gehrlein).

0165-4896 / 01 / $ – see front matter  2001 Elsevier Science B.V. All rights reserved. P I I : S 0 1 6 5 - 4 8 9 6 ( 0 0 ) 0 0 0 4 7 - 0

associated ranking as a representation of their preferences on candidates. We assume that

6

there are a total of n5_{o n voters, and n is also assumed to be an odd number.} i51 i

The Condorcet winner in an election is the candidate who would be able to defeat each of the other candidates in a series of pairwise elections. For example, A would be the Condorcet winner if it would both beat B by majority rule in a pairwise election, with n 1_n 1_n ._n 1_n 1_{n , and beat C by majority rule in a pairwise election,}

1 2 4 3 5 6

with n 1_n 1_n ._n 1_n 1_{n . It is well known that a Condorcet winner does not} 1 2 3 4 5 6

always exist (see Condorcet, 1785 in Sommerlad and McLean, 1989). However, if a Condorcet winner does exist, it would seem to be a good candidate for selection as the winner of the election. Numerous studies have considered the probability that a Condorcet winner exists, along with the Condorcet efficiency of common voting rules. The Condorcet efficiency of a voting rule is the conditional probability that the voting rule will elect the Condorcet winner, given that a Condorcet winner exists. Much of the work that has been done in these two areas is summarized in Gehrlein (1997).

In discussing the probability that a Condorcet winner exists, some assumption must be made regarding the likelihood that various combinations of n ’s are observed. A specifici

combination of n ’s that sum to n is referred to as a profile. Several assumptionsi

regarding the probability that various profiles are observed have become standards in analysis of the probability that a Condorcet winner exists and the analysis of the Condorcet efficiency of voting rules. The impartial anonymous culture condition (IAC) is used in the current study. IAC was first used in Kuga and Nagatani (1974), and it has

6

been used in numerous other studies. IAC requires that all profiles with n5_{o n are} i51 i

equally likely to be observed. The number of different profiles that exist for a given n is denoted as N(n). Feller (1957) shows that:

5

P

(n1_{i )}

n1₅ i51 ]]]]

N(n)5

S

D

5

5 120

The IAC condition, in which each of the N(n) possible profiles is equally to be observed, has been described as dealing with situations in which voters’ identities are not retained, so that they remain anonymous (Berg and Bjurulf, 1983). Berg (1985) and Stensholt (1999) give various other interpretations of the IAC assumption.

Gehrlein and Fishburn (1976) showed that the probability that a Condorcet winner exists under IAC for n (odd) voters is given by PCon(n, IAC), with:

2

15(n1₃₎ ]]]]]

P (n, IAC)5

Con _16(n12)(n14)

Gehrlein (1982) developed representations for the Condorcet efficiency of some common voting rules under the assumption of IAC for three candidate elections. The particular voting rules that were considered in Gehrlein (1982) are plurality rule (PR), negative plurality rule (NPR), plurality elimination (PER) and negative plurality elimination (NPER). PR requires voters to vote for their most preferred candidate, and the winner is the candidate receiving the most votes. NPR requires voters to vote for their two most preferred candidates, and the winner is the candidate receiving the most votes.

eliminated in the first stage. The remaining two candidates are then carried to a second stage, where the winner is determined by majority rule. PER uses plurality rule in the first stage, to eliminate the candidate receiving the fewest votes. NPER works in the same fashion as PER, but uses NPR in the first stage. Representations for the Condorcet efficiency of these voting rules for three candidates under IAC for n[h9, 21, 33, . . . , 189, . . .j are given by:

4 3 2

(119n 1_1348n 1_5486n 1_10812n1₁₀₃₉₅₎ ]]]]]]]]]]]]]

CE(n, PR, IAC)5

2

135(n1_1)(n1_{3) (n}1₅₎ 3 2

(68n 1_501n 1_834n2₃₁₅₎ ]]]]]]]]]

CE(n, NPR, IAC)5

108(n1_1)(n1_3)(n1₅₎

4 3 2

(523n 1_6191n 1_25117n 1_40749n1₂₂₁₄₀₎ ]]]]]]]]]]]]]]

CE(n, PER, IAC)5

2

540(n1_1)(n1_{3) (n}1₅₎

4 3 2

(131n 1_1542n 1_6144n 1_9018n1₃₆₄₅₎ ]]]]]]]]]]]]]

CE(n, NPER, IAC)5

2

135(n1_1)(n1_{3) (n}1₅₎

Table 1 shows computed values of PCon(n, IAC) and the Condorcet efficiency of the PR, NPR, PER and NPER using the representations from above.

The purpose of the current paper is to develop a closed form representation, like the ones given above, for the Condorcet efficiency of another important voting rule. The particular voting rule of interest to this study is Borda Rule (BR), which is a weighted scoring rule (WSR). WSR’s require voters to rank order the three candidates. Each voter’s first ranked candidate is then given W points, the second ranked candidate is given 1 point, and the third ranked candidate is given 0 points. Here, we have W$_1.

The candidate receiving the most total points is the winner of the election. The usual definition of WSR’s uses weights of 1, l _{and 0, respectively, for the first, second and}

third ranked candidates, with 0#l#_{1. Then PR is the WSR with} l5_{0, and NPR is the} Table 1

PCon(n, IAC) and the Condorcet efficiencies of voting rules with IAC

n PCon(n,IAC) PR NPR PER NPER BR

9 0.94406 0.85079 0.53651 0.95238 0.94286 0.88254 21 0.93913 0.86072 0.58537 0.96115 0.95911 0.89433 33 0.93822 0.86667 0.60050 0.96378 0.96335 0.89949 45 0.93791 0.87004 0.60791 0.96503 0.96527 0.90225 57 0.93776 0.87217 0.61231 0.96576 0.96637 0.90395 69 0.93768 0.87364 0.61523 0.96624 0.96708 0.90511 81 0.93763 0.87471 0.61730 0.96658 0.96758 0.90594 93 0.93760 0.87552 0.61885 0.96683 0.96794 0.90658 105 0.93758 0.87616 0.62006 0.96702 0.96822 0.90707 117 0.93757 0.87668 0.62102 0.96717 0.96845 0.90747 129 0.93755 0.87710 0.62181 0.96730 0.96863 0.90779 141 0.93755 0.87746 0.62246 0.96740 0.96878 0.90807 153 0.93754 0.87776 0.62302 0.96749 0.96890 0.90830

WSR with l5_{1. However, the definition that we use, with weights (W, 1, 0), is}

equivalent to the usual definition, and it is particularly useful in simplifying derivations that follow. BR is the WSR which has W5_2.

Van Newenhizen (1992) showed that BR is the WSR that maximizes Condorcet efficiency for a class of distributions, not including IAC, that define the probability that each possible profile is observed. Saari (1990) gives a number of other properties of BR to give strong additional support to its use as a WSR. Given this background, the development of a representation for the Condorcet efficiency of BR under IAC is of significant interest.

2. A representation for the Condorcet efficiency of Borda Rule

A

Let J (n) denote the number of IAC profiles with n voters for which A is both the

A

Condorcet winner and the winner by BR. To develop a representation for J (n), we first

B.A

let J (n) denote the number of IAC profiles with n voters for which A is the

A

Condorcet winner and for which B beats A by Borda Rule. Let Con (n) denote the number of IAC profiles with n voters for which A is the Condorcet winner. Lhuilier (1793) (in Sommerlad and McLean, 1989) showed that the Condorcet winner can never be beaten by both of the other candidates with BR. It then follows that:

A A B.A C.A

J (n)5_{Con (n)}2_{J (n)}2_{J (n)}

By the symmetry of IAC with respect to candidates:

A A B.A

J (n)5_{Con (n)}2_{2J (n)} A

We know the representation for Con (n) from Gehrlein and Fishburn (1976):

3

(n1_1)(n1_{3) (n}1₅₎

A _]]]]]]

Con (n)5

384

B.A

so we only need to develop a representation for J (n).

The conditions to have A as the Condorcet winner, with B the BR winner over A are given by:

n 1_n 1_n ._n 1_n 1_n 1 2 3 4 5 6 n 1_n 1_n ._n 1_n 1_n

1 2 4 3 5 6

2(n 1_{n )}1_n 1_n ._2(n 1_{n )}1_n 1_n 3 5 1 6 1 2 3 4

The restrictions that are needed to require consistency among the n ’s, given all threei

n2₁ ]]

0#_n #

56 ₂

0#_n #_n 5 56

n2₁ ]]

0#_n # 2 _n

3 ₂ 56 n2₁ ]]

0#_n # 2_n

4 ₂ 56

2n 1_n 1_2n 2_n

3 5 56

0#_n #_Min

H

J

2 _n2_n 2_n 2_n 3 4 56 a

Here, Minh jis the minimum of a and b, and n 5_n 1_{n .}

b 56 5 6

When A is the Condorcet winner, it is easily shown that we must have:

2n 1_n 1_2n 2_n,_n2_n 2_n 2_n

3 5 56 3 4 56

Thus, the Min argument in the n summation counter can be removed. In addition, to2

have consistency between the upper and lower summation limits of the n counter, we2

must be assured that:

2n 1_n 1_2n 2_n$₀

3 5 56

So, we must add the restriction that:

1

]

n $ _[n2_n 2_{2n ]} 3 2 5 56

To then have consistency between the upper and lower summation limits of the n3

counter, we must be assured that:

n2_{1 1}

]]2_n $]_[n2_n 2_{2n ]} 56 5 56

2 2

which requires n $_{1, so that n} $_1.

5 56

The resulting limitations on the n ’s after accounting for all of these consistencyi

requirements are given by:

n2₁ ]]

1#_n #

56 ₂

1#_n #_n 5 56

0 _n21

1 ]]

Max #_n # 2_n

3 56

H

]_fn2_n 2_{2n g}

J

2

5 56

2

n2₁ ]]

0#_n # 2 _n

4 ₂ 56

0#_n #_2n 1_n 1_2n 2_n

2 3 5 56 a

Here, Maxh jb is the maximum of a and b.

It simplifies matters in later discussion to treat the specific case of n 5_{1 as a special} 56

case. For this special case, the n ’s must have: n 5_{0, n} 5_{1, n} 5_(n2_{3) / 2, n} 5_0,

i 6 5 3 2

and 0#_n #_(n2_{3) / 2. It is easily shown that there are (n –1) / 2 possible profiles of this} 4

type, and we are then interested in determining the number of IAC profiles in the remainder of the space covered by the summation indexes with:

n2₁ ]]

2#_n #

56 ₂

1#_n #_n 5 56

0 _n21

1 ]]

Max #_n # 2 _n

3 56

H

]_fn2_n 2_{2n g}

J

2

5 56

2

n2₁ ]]

0#_n # 2 _n

4 ₂ 56

0#_n #_2n 1_n 1_2n 2_n

2 3 5 56 1

]

The [n2_n 2_{2n ] term in the Max argument on the n counter poses a particular}

5 56 3

2

problem, since it is constrained to have an integer value that is consistent with that limit. To account for this, it is necessary to deal with odd and even values of n as separate5

cases. The first step in the procedure is to account for odd and even values of n56 as separate cases. We assume that the term (n2_{1) / 4 is integer valued, so that n[h9, 21,}

33, . . . , 189, . . . . These values on n will then allow for direct comparison with thej

Condorcet efficiency values that are reported in Table 1 for the other voting rules. For any given (n2_{1) / 2 upper limit of n , there are (n}2_{1) / 4 different even values}

56

of n to be enumerated, with n 5_{2, 4, 6, 8, . . . , (n}2_{1) / 2. For each (n}2_{1) / 2 upper}

56 56

limit of n , there are (n2_{5) / 4 odd values of n to be enumerated, with n} 5_{3, 5,}

56 56 56

7, . . . , (n2_{3) / 2, since n} 5_{1 was treated as a special case. The space of n ’s that is}

56 i

shown above is then partitioned into two subspaces to account for the differences that result from the odd and even n56 terms.

*

The case of even values of n defines n 5_{2n with:} 56 56 56 n2₁

]] *

1#_n #

56 ₄ *

1#_n #_2n 5 56

0 _n21

1 ]] _*

Max #_n # 2 _2n

3 56

H

]_fn2_n 2_4n*g

J

2

5 56

2

n2₁

]] _*

0#_n # 2 _2n

4 ₂ 56 *

0#_n #_2n 1_n 1_4n 2_n

2 3 5 56

*

The case of odd values of n defines n 5_2n 1_{1 with:} 56 56 56

n2₅ ]] *

1#_n #

56 ₄ *

1#_n #_2n 1₁

5 56

0 _n2₃

1 ]] _*

Max #_n # 2 _2n

3 56

H

]_fn2₂2_n 2_4n*g

J

2

5 56

2

n2₃

]] _*

0#_n # 2 _2n

4 ₂ 56 *

0#_n #_2n 1_n 1_4n 2_n1₂ 2 3 5 56

Once that we have established the odd–even status of the n56 counter, it is then possible to deal with the odd–even status of n .5

Consider the subspace that accounts for even values of n , and the corresponding56

value for the upper limit of the n index. For each even upper limit of n , there are n5 5 56/ 2 even values of n to be enumerated, with n 5_{2, 4, 6, . . . , n . Similarly, for each even}

5 5 56

upper limit value of n , there are n / 2 odd values of n to be enumerated, with n 5_1,

5 56 5 5

3, 4, . . . , n 2_{1. Once the odd–even status of both of the n and n indexes have been}

56 56 5

1

]

established, the associated integer value of the [n2_n 2_{2n ] term to be used in the} 5 56

2

Max argument on the n counter can be determined. The summation that is given above3

for even n56is then partitioned into two subspaces to account for odd and even values of

n , when n5 56 is even.

*

The case of even n with even values of n , with n 5_{2n [denoted as Subspace}

56 5 5 5

Even–Even] has limits given by:

n2₁ ]] *

1#_n #

56 ₄ * *

1#_n #_n 5 56

0 _n21

n1₁ ]] _*

Max #_n # 2 _2n

3 56

H

]]2_n*2_2n*

J

2

5 56

2

n2₁

]] _*

0#_n # 2 _2n

4 ₂ 56 * *

0#_n #_2n 1_2n 1_4n 2_n

2 3 5 56

*

The case of even n with odd values of n , with n 5_2n 2_{1 [denoted as Subspace}

56 5 5 5

Even–Odd] has limits given by:

n2₁ ]] *

1#_n #

56 ₄ * *

1#_n #_n 5 56

0 _n21

n1₁ ]] _*

Max #_n # 2 _2n

3 56

H

]]2_n*2_2n*

J

2

5 56

2

n2₁

]] _*

0#_n # 2 _2n

4 ₂ 56 * *

0#_n #_2n 1_2n 1_4n 2_n2₁ 2 3 5 56

The same general procedure can then be used for the subspace that accounts for odd values of n , and the corresponding upper limit of the n index. For each possible odd56 5

upper limit value of n , there are (n 2_{1) / 2 even values of n to be enumerated, with}

5 56 5

n 5_{2, 4, 6, . . . , n} 2_{1. Similarly, for each odd upper limit value of n , there are}

5 56 5

(n 1_{1) / 2 odd values of n to be enumerated, with n} 5_{1, 3, 4, . . . , n . Once the}

56 5 5 56

odd–even status of both of the n56 and n5 indexes have been established, the

1

]

corresponding integer value of the [n2_n 2_{2n ] term to be used in the Max} 5 56

2

argument on the n counter can be determined. The summation that is given above for3

odd n56 is partitioned into two subspaces to account for odd and even values of n when5 n56 is odd.

*

The case of odd n with even values of n , with n 5_{2n [denoted as Subspace}

56 5 5 5

n2₅ ]] *

1#_n #

56 ₄ * *

1#_n #_n 5 56

0 _n23

n2₁ ]] _*

Max #_n # 2 _2n

3 56

H

]]2_n*2_2n*

J

2

5 56

2

n2₃

]] _*

0#_n # 2 _2n

4 ₂ 56 * *

0#_n #_2n 1_2n 1_4n 2_n1₂ 2 3 5 56

*

The case of odd n with odd values of n , with n 5_2n 2_{1 [denoted as Subspace}

56 5 5 5

Odd–Odd] has limits given by:

n2₅ ]] *

1#_n #

56 ₄ * *

1#_n #_n 1₁

5 56

0 _n23

n2₁ ]] _*

Max #_n # 2 _2n

3 56

H

]]2_n*2_2n*

J

2

5 56

2

n2₃

]] _*

0#_n # 2 _2n

4 ₂ 56 * *

0#_n #_2n 1_2n 1_4n 2_n1₁ 2 3 5 56

At this point, the odd–even factor has been removed from each of the subspaces, and it is now possible to use standard procedures to further partition the subspaces, in order to remove the Max argument from the n index limit, as in Gehrlein (1982).3

Subspace [Even–Even] is partitioned into three subspaces:

Subspace No. 1 Subspace No. 2

n1_{3 n}2_{1 n}2₃

]]#_n* #]] ₁#_n* #]]

56 56

6 4 6

n1₃

]]2_2n*#_n*#_{n* 1}#_n*#_n* 56 5 56 5 56

2

n2_{1 n}1_{1 n}2₁

]] _* ]] _{* *} ]] _*

0#_n # 2_2n 2_n 2_2n #_n # 2_2n

3 ₂ 56 ₂ 5 56 3 ₂ 56

n2_{1 n}2₁

]] _* ]] _*

0#_n # 2_{2n 0}#_n # 2_2n

4 ₂ 56 4 ₂ 56

* * * *

0#_n #_2n 1_2n 1_4n 2_{n 0}#_n #_2n 1_2n 1_4n 2_n

2 3 5 56 2 3 5 56

Subspace No. 3

n1_{3 n}2₁ ]]#_n* #]]

56

6 4

n1₁ ]]

* *

1#_n # 2_2n

5 ₂ 56

n1_{1 n}2₁

]]2_n*2_2n*#_n #]]2_2n* 5 56 3 56

2 2

n2₁

]] _*

0#_n # 2_2n

4 ₂ 56 * *

0#_n #_2n 1_2n 1_4n 2_n

To describe the partitioning of Subspace [Even–Even], suppose that we eliminate the

* *

Max argument in the n counter by requiring 0._(n1_{1) / 2}2_n 2_{2n . This then leads}

3 5 56

to the additional consistency restriction that:

n1₃ ]]2_2n*

56 _{* *}

Max ₂ #_n #_n

5 56

H

₁

J

*

For consistency between the upper and lower limits of this modified n5 counter, we

* *

must have n $_(n1_{3) / 6. Given the limits on the n counter, it is easily shown that}

56 56

* *

(n1_{3) / 2}2_2n $_{1, to eliminate the Max argument in this modified n counter. All of}

56 5

this leads to the summation limits of Subspace No. 1.

* *

The remaining partition of Subspace [Even–Even], with 0#_(n1_{1) / 2}2_n 2_{2n to} 5 56

eliminate the Max argument in the n3 counter, leads to the summation limits for Subspace No. 2 and Subspace No. 3.

In the same fashion, Subspace [Even–Odd] is partitioned into three subspaces:

Subspace No. 4 Subspace No. 5

n1_{3 n}2_{1 n}1_{3 n}2₁

]]#_n* #]] ]]#_n* #]]

56 56

6 4 6 4

n1_{3 n}1₁

]]2_2n*#_n*#_{n* 1}#_n*#]]2_2n*

56 5 56 5 56

2 2

n2_{1 n}1_{1 n}2₁

]] _* ]] _{* *} ]] _*

0#_n # 2_2n 2_n 2_2n #_n # 2_2n

3 ₂ 56 ₂ 5 56 3 ₂ 56

n2_{1 n}2₁

]] _* ]] _*

0#_n # 2_{2n 0}#_n # 2_2n

4 ₂ 56 4 ₂ 56

* * * *

0#_n #_2n 1_2n 1_4n 2_n2_{1 0}#_n #_2n 1_2n 1_4n 2_n2₁

2 3 5 56 2 3 5 56

Subspace No. 6

n2₃ ]] *

1#_n #

56 ₆ * *

1#_n #_n 5 56

n1_{1 n}2₁

]]2_n*2_2n*#_n #]]2_2n* 5 56 3 56

2 2

n2₁

]] _*

0#_n # 2_2n

4 ₂ 56 * *

0#_n #_2n 1_2n 1_4n 2_n2₁ 2 3 5 56

Subspace No. 7 Subspace No. 8

n1_{3 n}2_{5 n}1_{3 n}2₅

]]#_n* #]] ]]#_n* #]]

56 56

6 4 6 4

n2_{1 n}2₃

]]2_2n*#_n*#_{n* 1}#_n*#]]2_2n*

56 5 56 5 56

2 2

n2_{3 n}2_{1 n}2₃

]] _* ]] _{* *} ]] _*

0#_n # 2_2n 2_n 2_2n #_n # 2_2n

3 ₂ 56 ₂ 5 56 3 ₂ 56

n2_{3 n}2₃

]] _* ]] _*

0#_n # 2_{2n 0}#_n # 2_2n

4 ₂ 56 4 ₂ 56

* * * *

0#_n #_2n 1_2n 1_4n 2_n1_{2 0}#_n #_2n 1_2n 1_4n 2_n1₂

2 3 5 56 2 3 5 56

Subspace No. 9

n2₃ ]] *

1#_n #

56 ₆ * *

1#_n #_n 5 56

n2_{1 n}2₃

]]2_n*2_2n*#_n #]]2_2n* 5 56 3 56

2 2

n2₃

]] _*

0#_n # 2_2n

4 ₂ 56 * *

0#_n #_2n 1_2n 1_4n 2_n1₂ 2 3 5 56

Subspace [Odd–Odd] is partitioned into three subspaces:

Subspace No. 10 Subspace No. 11

n1_{3 n}2_{5 n}2₃

]]#_n* #]] ₁#_n* #]]

56 56

6 4 6

n1₁

]]2_2n*#_n*#_n*1_{1 1}#_n*#_n*1₁ 56 5 56 5 56

2

n2_{3 n}2_{1 n}2₃

]] _* ]] _{* *} ]] _*

0#_n # 2_2n 2_n 2_2n #_n # 2_2n

3 ₂ 56 ₂ 5 56 3 ₂ 56

n2_{3 n}2₃

]] _* ]] _*

0#_n # 2_{2n 0}#_n # 2_2n

4 ₂ 56 4 ₂ 56

* * * *

0#_n #_2n 1_2n 1_4n 2_n1_{1 0}#_n #_2n 1_2n 1_4n 2_n1₁

2 3 5 56 2 3 5 56

Subspace No. 12

n1_{3 n}2₅ ]]#_n* #]]

56

6 4

n2₁ ]]

* *

1#_n # 2_2n

5 ₂ 56

n2_{1 n}2₃

]]2_n*2_2n*#_n #]]2_2n* 5 56 3 56

2 2

n2₃

]] _*

0#_n # 2_2n

4 ₂ 56 * *

0#_n #_2n 1_2n 1_4n 2_n1₁ 2 3 5 56

*

the upper and lower limits on the n56index in these subspaces would simply be modified to account for the restriction that each must have an integer value.

By sequentially using known algebraic relations for sums of powers of integers, a simple representation,[S , can be obtained for the number of IAC profiles in each of thei

twelve subspaces. Including the special case with n 5_{1, we can then obtain a} 56

A

representation for J (n) from:

12 n2₁

A A _]]

J (n)5_{Con (n)}2₂

H

1

O

_[S

J

i

2 i51

After significant algebraic reduction, we obtain the representation:

5 4 3 2

123n 1_1785n 1_9970n 1_27270n 1_38547n1₂₄₇₀₅

A _{]]]]]]]]]]]]]]]]}

J (n)5

51840

A

This representation for J (n) has been verified by computer enumeration.

It follows from the symmetry of IAC with respect to candidates that the joint probability that a candidate is both the Condorcet winner and the BR winner is

A

3J (n) /N(n). This joint probability is then divided by PCon(n, IAC) to obtain the Condorcet efficiency, CE(n, BR, IAC), of BR for n voters with three candidates under IAC. After substitution and reduction we obtain:

4 3 2

123n 1_1416n 1_5722n 1_10104n1₈₂₃₅ ]]]]]]]]]]]]

CE(n, BR, IAC)5

2

135(n1_1)(n1_{3) (n}1₅₎

with n[h9, 21, 33, . . . , 189, . . . . Computed values of CE(n, BR, IAC) are given inj

Table 1. The computed values of CE(n, BR, IAC) in Table 1 are consistent with results obtained from computation by enumeration in Gehrlein (1995).

3. Conclusion

Different types of voting rules require different amounts of input from the voters. PR and NPR simply require voters to report their most preferred candidates, without ranking them. WSR’s, like BR, require that voters report their complete preference rankings on candidates. Two-stage elimination rules require that voters must go through the election procedure in two steps. It is natural to consider the expected benefits that are obtained as we increase the complexity of the election procedure that is used.

Given the closed form representation for CE(n, BR, IAC), we see that the Condorcet efficiency of BR increases as n increases for three candidate elections with IAC. The computed values in Table 1 indicate a relatively consistent increase in Condorcet efficiency, of about 0.03, in using BR instead of PR for all n values. Similarly, there is a relatively consistent increase in Condorcet efficiency, of about 0.06, in using PER instead of BR for all n values. Thus, the improvement in Condorcet efficiency is greater in moving from a WSR to a two-stage elimination election, than from moving from PR to a WSR.

Acknowledgements

The authors are indebted to Sven Berg and an anonymous reviewer for helpful suggestions on an earlier version of this manuscript.

References

Berg, S., 1985. Paradox of voting under an urn model: The effect of homogeneity. Public Choice 47, 377–387. Berg, S., Bjurulf, B., 1983. A note on the paradox of voting: Anonymous preference profiles and May’s

formula. Public Choice 40, 307–316.

Condorcet, Marquis de, 1785. An essay on the application of probability theory to plurality decision making: An election between three candidates. In: Sommerlad, F., McLean, I., The Political Theory of Condorcet, University of Oxford, 1989, pp. 69–80.

Feller, W., 1957. An Introduction to Probability Theory and Its Applications, 2nd Edition, John Wiley, New York.

Gehrlein, W., 1982. Condorcet efficiency and constant scoring rules. Mathematical Social Sciences 2, 123–130. Gehrlein, W., 1995. Condorcet efficiency and social homogeneity. In: Barnett, W., Moulin, H., Salles, M.,

Schofield, N. (Eds.), Social Choice, Welfare and Ethics, Cambridge University Press, pp. 127–143. Gehrlein, W., 1997. Condorcet’s Paradox and the Condorcet efficiency of voting rules. Mathematica Japonica

45, 173–199.

Gehrlein, W., Fishburn, P., 1976. Condorcet’s Paradox and anonymous preference profiles. Public Choice 26, 1–18.

Kuga, K., Nagatani, H., 1974. Voter antagonism and the paradox of voting. Econometrica 42, 1045–1067. Lhuilier, S., 1793. An examination of the election method proposed to the National Convention of France in

February 1793, and adopted in Geneva. In: Sommerlad, F., McLean, I., The Political Theory of Condorcet, 1989, pp. 223–253.

Saari, D., 1990. The Borda dictionary. Social Choice and Welfare 7, 279–317.

Sommerlad, F., McLean, I., 1989. The Political Theory of Condorcet, Working Paper, University of Oxford. Stensholt, E., 1999. Beta distributions in a simplex and impartial anonymous cultures. Mathematical Social

Sciences 37, 45–57.

Van Newenhizen, J., 1992. The Borda method is most likely to respect the Condorcet principle. Economic Theory 2, 69–83.

Consider the subspace that accounts for even values of n , and the corresponding56 value for the upper limit of the n index. For each even upper limit of n , there are n5 5 56/ 2 even values of n to be enumerated, with n 5_{2, 4, 6, . . . , n . Similarly, for each even}

5 5 56

upper limit value of n , there are n / 2 odd values of n to be enumerated, with n 5_1,

5 56 5 5

3, 4, . . . , n 2_{1. Once the odd–even status of both of the n and n indexes have been}

56 56 5

1 ]

established, the associated integer value of the [n2_n 2_{2n ] term to be used in the} 5 56

2

Max argument on the n counter can be determined. The summation that is given above3 for even n56is then partitioned into two subspaces to account for odd and even values of

n , when n5 56 is even.

*

The case of even n with even values of n , with n 5_{2n [denoted as Subspace}

56 5 5 5

Even–Even] has limits given by:

n2₁ ]]

*

1#_n # 56 ₄

* *

1#_n #_n 5 56

0 _n21

n1₁ ]] _*

Max #_n # 2 _2n

3 56

H

]]2_n*2_2n*

J

2

5 56 2

n2₁

]] _*

0#_n # 2 _2n

4 ₂ 56

* *

0#_n #_2n 1_2n 1_4n 2_n

2 3 5 56

*

The case of even n with odd values of n , with n 5_2n 2_{1 [denoted as Subspace}

56 5 5 5

Even–Odd] has limits given by:

n2₁ ]]

*

1#_n # 56 ₄

* *

1#_n #_n 5 56

0 _n21

n1₁ ]] _*

Max #_n # 2 _2n

3 56

H

]]2_n*2_2n*

J

2

5 56 2

n2₁

]] _*

0#_n # 2 _2n

4 ₂ 56

* *

0#_n #_2n 1_2n 1_4n 2_n2₁

2 3 5 56

The same general procedure can then be used for the subspace that accounts for odd values of n , and the corresponding upper limit of the n index. For each possible odd56 5 upper limit value of n , there are (n 2_{1) / 2 even values of n to be enumerated, with}

5 56 5

n 5_{2, 4, 6, . . . , n} 2_{1. Similarly, for each odd upper limit value of n , there are}

5 56 5

(n 1_{1) / 2 odd values of n to be enumerated, with n} 5_{1, 3, 4, . . . , n . Once the}

56 5 5 56

odd–even status of both of the n56 and n5 indexes have been established, the 1

]

corresponding integer value of the [n2_n 2_{2n ] term to be used in the Max} 5 56

2

argument on the n counter can be determined. The summation that is given above for3 odd n56 is partitioned into two subspaces to account for odd and even values of n when5

n56 is odd.

*

The case of odd n with even values of n , with n 5_{2n [denoted as Subspace}

56 5 5 5

n2₅ ]]

*

1#_n # 56 ₄

* *

1#_n #_n 5 56

0 _n23

n2₁ ]] _*

Max #_n # 2 _2n

3 56

H

]]2_n*2_2n*

J

2

5 56 2

n2₃

]] _*

0#_n # 2 _2n

4 ₂ 56

* *

0#_n #_2n 1_2n 1_4n 2_n1₂

2 3 5 56

*

The case of odd n with odd values of n , with n 5_2n 2_{1 [denoted as Subspace}

56 5 5 5

Odd–Odd] has limits given by:

n2₅ ]]

*

1#_n # 56 ₄

* *

1#_n #_n 1₁ 5 56

0 _n23

n2₁ ]] _*

Max #_n # 2 _2n

3 56

H

]]2_n*2_2n*

J

2

5 56 2

n2₃

]] _*

0#_n # 2 _2n

4 ₂ 56

* *

0#_n #_2n 1_2n 1_4n 2_n1₁

2 3 5 56

At this point, the odd–even factor has been removed from each of the subspaces, and it is now possible to use standard procedures to further partition the subspaces, in order to remove the Max argument from the n index limit, as in Gehrlein (1982).3

Subspace [Even–Even] is partitioned into three subspaces: Subspace No. 1 Subspace No. 2

n1_{3 n}2_{1 n}2₃

]]#_n* #]] ₁#_n* #]]

56 56

6 4 6

n1₃

]]2_2n*#_n*#_{n* 1}#_n*#_n*

56 5 56 5 56

2

n2_{1 n}1_{1 n}2₁

]] _* ]] _{* *} ]] _*

0#_n # 2_2n 2_n 2_2n #_n # 2_2n

3 ₂ 56 ₂ 5 56 3 ₂ 56

n2_{1 n}2₁

]] _* ]] _*

0#_n # 2_{2n 0}#_n # 2_2n

4 ₂ 56 4 ₂ 56

* * * *

0#_n #_2n 1_2n 1_4n 2_{n 0}#_n #_2n 1_2n 1_4n 2_n

2 3 5 56 2 3 5 56

Subspace No. 3

n1_{3 n}2₁

]]#_n* #]] 56

6 4

n1₁ ]]

* *

1#_n # 2_2n

5 ₂ 56

n1_{1 n}2₁

]]2_n*2_2n*#_n #]]2_2n*

5 56 3 56

2 2

n2₁

]] _*

0#_n # 2_2n

4 ₂ 56

* *

0#_n #_2n 1_2n 1_4n 2_n

To describe the partitioning of Subspace [Even–Even], suppose that we eliminate the

* *

Max argument in the n counter by requiring 0._(n1_{1) / 2}2_n 2_{2n . This then leads}

3 5 56

to the additional consistency restriction that:

n1₃ ]]2_2n56*

* *

Max ₂ #_n #_n 5 56

H

₁

J

*

For consistency between the upper and lower limits of this modified n5 counter, we

* *

must have n $_(n1_{3) / 6. Given the limits on the n counter, it is easily shown that}

56 56

* *

(n1_{3) / 2}2_2n $_{1, to eliminate the Max argument in this modified n counter. All of}

56 5

this leads to the summation limits of Subspace No. 1.

* *

The remaining partition of Subspace [Even–Even], with 0#_(n1_{1) / 2}2_n 2_{2n to} 5 56 eliminate the Max argument in the n3 counter, leads to the summation limits for Subspace No. 2 and Subspace No. 3.

In the same fashion, Subspace [Even–Odd] is partitioned into three subspaces: Subspace No. 4 Subspace No. 5

n1_{3 n}2_{1 n}1_{3 n}2₁

]]#_n* #]] ]]#_n* #]]

56 56

6 4 6 4

n1_{3 n}1₁

]]2_2n*#_n*#_{n* 1}#_n*#]]2_2n*

56 5 56 5 56

2 2

n2_{1 n}1_{1 n}2₁

]] _* ]] _{* *} ]] _*

0#_n # 2_2n 2_n 2_2n #_n # 2_2n

3 ₂ 56 ₂ 5 56 3 ₂ 56

n2_{1 n}2₁

]] _* ]] _*

0#_n # 2_{2n 0}#_n # 2_2n

4 ₂ 56 4 ₂ 56

* * * *

0#_n #_2n 1_2n 1_4n 2_n2_{1 0}#_n #_2n 1_2n 1_4n 2_n2₁

2 3 5 56 2 3 5 56

Subspace No. 6

n2₃ ]]

*

1#_n # 56 ₆

* *

1#_n #_n 5 56

n1_{1 n}2₁

]]2_n*2_2n*#_n #]]2_2n*

5 56 3 56

2 2

n2₁

]] _*

0#_n # 2_2n

4 ₂ 56

* *

0#_n #_2n 1_2n 1_4n 2_n2₁

2 3 5 56

Subspace No. 7 Subspace No. 8

n1_{3 n}2_{5 n}1_{3 n}2₅

]]#_n* #]] ]]#_n* #]]

56 56

6 4 6 4

n2_{1 n}2₃

]]2_2n*#_n*#_{n* 1}#_n*#]]2_2n*

56 5 56 5 56

2 2

n2_{3 n}2_{1 n}2₃

]] _* ]] _{* *} ]] _*

0#_n # 2_2n 2_n 2_2n #_n # 2_2n

3 ₂ 56 ₂ 5 56 3 ₂ 56

n2_{3 n}2₃

]] _* ]] _*

0#_n # 2_{2n 0}#_n # 2_2n

4 ₂ 56 4 ₂ 56

* * * *

0#_n #_2n 1_2n 1_4n 2_n1_{2 0}#_n #_2n 1_2n 1_4n 2_n1₂

2 3 5 56 2 3 5 56

Subspace No. 9

n2₃ ]]

*

1#_n # 56 ₆

* *

1#_n #_n 5 56

n2_{1 n}2₃

]]2_n*2_2n*#_n #]]2_2n*

5 56 3 56

2 2

n2₃

]] _*

0#_n # 2_2n

4 ₂ 56

* *

0#_n #_2n 1_2n 1_4n 2_n1₂

2 3 5 56

Subspace [Odd–Odd] is partitioned into three subspaces: Subspace No. 10 Subspace No. 11

n1_{3 n}2_{5 n}2₃

]]#_n* #]] ₁#_n* #]]

56 56

6 4 6

n1₁

]]2_2n*#_n*#_n*1_{1 1}#_n*#_n*1₁

56 5 56 5 56

2

n2_{3 n}2_{1 n}2₃

]] _* ]] _{* *} ]] _*

0#_n # 2_2n 2_n 2_2n #_n # 2_2n

3 ₂ 56 ₂ 5 56 3 ₂ 56

n2_{3 n}2₃

]] _* ]] _*

0#_n # 2_{2n 0}#_n # 2_2n

4 ₂ 56 4 ₂ 56

* * * *

0#_n #_2n 1_2n 1_4n 2_n1_{1 0}#_n #_2n 1_2n 1_4n 2_n1₁

2 3 5 56 2 3 5 56

Subspace No. 12

n1_{3 n}2₅

]]#_n* #]] 56

6 4

n2₁ ]]

* *

1#_n # 2_2n

5 ₂ 56

n2_{1 n}2₃

]]2_n*2_2n*#_n #]]2_2n*

5 56 3 56

2 2

n2₃

]] _*

0#_n # 2_2n

4 ₂ 56

* *

0#_n #_2n 1_2n 1_4n 2_n1₁

2 3 5 56

*

the upper and lower limits on the n56index in these subspaces would simply be modified to account for the restriction that each must have an integer value.

By sequentially using known algebraic relations for sums of powers of integers, a simple representation,[S , can be obtained for the number of IAC profiles in each of thei twelve subspaces. Including the special case with n 5_{1, we can then obtain a}

56 A

representation for J (n) from:

12

n2₁

A A _]]

J (n)5_{Con (n)}2₂

H

1

O

_[S

J

i 2 i51

After significant algebraic reduction, we obtain the representation:

5 4 3 2

123n 1_1785n 1_9970n 1_27270n 1_38547n1₂₄₇₀₅

A _{]]]]]]]]]]]]]]]]}

J (n)5

51840 A

This representation for J (n) has been verified by computer enumeration.

It follows from the symmetry of IAC with respect to candidates that the joint probability that a candidate is both the Condorcet winner and the BR winner is

A

3J (n) /N(n). This joint probability is then divided by PCon(n, IAC) to obtain the Condorcet efficiency, CE(n, BR, IAC), of BR for n voters with three candidates under IAC. After substitution and reduction we obtain:

4 3 2

123n 1_1416n 1_5722n 1_10104n1₈₂₃₅ ]]]]]]]]]]]] CE(n, BR, IAC)5

2 135(n1_1)(n1_{3) (n}1₅₎

with n[h9, 21, 33, . . . , 189, . . . . Computed values of CE(n, BR, IAC) are given inj

Table 1. The computed values of CE(n, BR, IAC) in Table 1 are consistent with results obtained from computation by enumeration in Gehrlein (1995).

3. Conclusion

Different types of voting rules require different amounts of input from the voters. PR and NPR simply require voters to report their most preferred candidates, without ranking them. WSR’s, like BR, require that voters report their complete preference rankings on candidates. Two-stage elimination rules require that voters must go through the election procedure in two steps. It is natural to consider the expected benefits that are obtained as we increase the complexity of the election procedure that is used.

Given the closed form representation for CE(n, BR, IAC), we see that the Condorcet efficiency of BR increases as n increases for three candidate elections with IAC. The computed values in Table 1 indicate a relatively consistent increase in Condorcet efficiency, of about 0.03, in using BR instead of PR for all n values. Similarly, there is a relatively consistent increase in Condorcet efficiency, of about 0.06, in using PER instead of BR for all n values. Thus, the improvement in Condorcet efficiency is greater in moving from a WSR to a two-stage elimination election, than from moving from PR to a WSR.

Acknowledgements

The authors are indebted to Sven Berg and an anonymous reviewer for helpful suggestions on an earlier version of this manuscript.

References

Berg, S., 1985. Paradox of voting under an urn model: The effect of homogeneity. Public Choice 47, 377–387. Berg, S., Bjurulf, B., 1983. A note on the paradox of voting: Anonymous preference profiles and May’s

formula. Public Choice 40, 307–316.

Condorcet, Marquis de, 1785. An essay on the application of probability theory to plurality decision making: An election between three candidates. In: Sommerlad, F., McLean, I., The Political Theory of Condorcet, University of Oxford, 1989, pp. 69–80.

Feller, W., 1957. An Introduction to Probability Theory and Its Applications, 2nd Edition, John Wiley, New York.

Gehrlein, W., 1982. Condorcet efficiency and constant scoring rules. Mathematical Social Sciences 2, 123–130. Gehrlein, W., 1995. Condorcet efficiency and social homogeneity. In: Barnett, W., Moulin, H., Salles, M.,

Schofield, N. (Eds.), Social Choice, Welfare and Ethics, Cambridge University Press, pp. 127–143. Gehrlein, W., 1997. Condorcet’s Paradox and the Condorcet efficiency of voting rules. Mathematica Japonica

45, 173–199.

Gehrlein, W., Fishburn, P., 1976. Condorcet’s Paradox and anonymous preference profiles. Public Choice 26, 1–18.

Kuga, K., Nagatani, H., 1974. Voter antagonism and the paradox of voting. Econometrica 42, 1045–1067. Lhuilier, S., 1793. An examination of the election method proposed to the National Convention of France in

February 1793, and adopted in Geneva. In: Sommerlad, F., McLean, I., The Political Theory of Condorcet, 1989, pp. 223–253.

Saari, D., 1990. The Borda dictionary. Social Choice and Welfare 7, 279–317.

Sommerlad, F., McLean, I., 1989. The Political Theory of Condorcet, Working Paper, University of Oxford. Stensholt, E., 1999. Beta distributions in a simplex and impartial anonymous cultures. Mathematical Social

Sciences 37, 45–57.

Van Newenhizen, J., 1992. The Borda method is most likely to respect the Condorcet principle. Economic Theory 2, 69–83.