Contents

Description of CHPV and GV

Introduction
Analogy
Weightings
Voting
Counting
Outcomes
Party-List
Summary

Evaluations of CHPV and GV

Ranked Ballot

Introduction (RB)
General Criteria
Majority Criteria
Clones & Teaming
Teaming Thresholds
Summary (RB)

Party-List

Introduction (PL)
Diagrams & Maps
CHPV Maps
Optimality
Party Cloning
Proportionality
Summary (PL)

Comparisons of CHPV with other voting systems

Single-Winner

Introduction (SW)
Plurality (FPTP)
Borda Count
Geometric Voting
Positional Voting
Condorcet Methods
AV (IRV)
Plur. Rule Methods
Summary (SW)

Multiple-Winner

Introduction (MW)
STV
Party-List
PL ~ Hare
PL ~ Droop
~ Maps Opt PC Pro
PL ~ D'Hondt
~ Maps Opt PC Pro
PL ~ Sainte-Laguë
~ Maps Opt PC Pro
Mixed Member Sys
Summary (MW)

Conclusions

Ranked Ballot CHPV
Party-List CHPV

General

Table of Contents

Map Construction

Table of Contents

Mathematical Proofs

Table of Contents
Notation & Formats

Valid XHTML 1.0 Strict

Valid CSS

Home About Description Evaluations(RB) Evaluations(PL) Comparisons(SW) Comparisons(MW) Conclusions General Maps Proofs
Home About Description Evaluations(RB) Evaluations(PL) Comparisons(SW) Comparisons(MW) Conclusions General Maps Proofs
Home > Proofs > Clones & Teaming > EC1
Last Revision: New on 25 Aug 2012

Mathematical Proofs: Clones, Teaming and Independence Criteria

Proof EC1: GV (any r) is not Independent of Irrelevant Alternatives

Scenario: Three candidates A, B and C contest a ranked ballot GV election. The common ratio may be any value in its range of 0 ≤ r < 1. Let v + x, v and v - y be the number of ranked ballots of the same type cast by the appropriate group of voters. Using standard notation and formats, the profile for this election scenario is given below.

The standard GV weightings are used here to determine the tallies (T) for candidates A, B and C. The conditions for A beating B, A beating C and B beating C are then derived as shown below.

Proof EC1a

As the above two conditions relating to candidate C are always TRUE regardless of the value of r, then A beats C and B beats C for all r. However, the ranking of A and B depends on the value of r as stated below.

Case 1: Candidates B and C both lose. By taking B as the irrelevant alternative, now consider the effect of the withdrawal of B from the election by rerunning it without B yet maintaining the relative preference of every voter for A over C or the reverse. The rerun election profile is given below.

The rerun candidate tallies and ranking conditions are derived as shown below.

Proof EC1b

Notice that the condition for A beating C is not a function of r (for this case 1). It is easy to allocate values to this condition such that it is FALSE; for example, where x = 1, y = 1 and v ≥ 3. Hence, for all 0 ≤ r < x/y, C can beat A. Therefore, as A can fail to win the election merely as a result of a losing and irrelevant candidate (B) withdrawing from the contest, then the independence criterion is not satisfied for case 1.

Case 2: A fails to win as B ties with A here. Case 3: A fails to win as B beats A. In both cases, A fails to win and C is a losing and irrelevant candidate. Now consider the withdrawal of C from the election by rerunning it without C yet maintaining the relative preference of every voter for B over A or the reverse. The new rerun profile is given below.

The new rerun candidate tallies and ranking conditions are derived as shown below.

Proof EC1c

Notice that the condition for A beating B is not a function of r (for cases 2 and 3). Also, as x and v - y are both positive, then this condition is always TRUE. Hence, for all x/y ≤ r < 1, A beats B. Therefore, as A now wins the election (where previously A did not) merely as a result of a losing and irrelevant candidate (C) withdrawing from the contest, then the independence criterion is not satisfied for case 2 or 3.

Cases 1, 2 and 3: For every case of this election profile and for all valid values of r, the withdrawal of an irrelevant candidate can overturn the outcome of the single-winner contest. There are numerous other profiles that produce similar upsets. Hence, GV (any r) is not Independent of Irrelevant Alternatives.


Return to main text > Evaluations: Clones & Teaming 1

Refer to > Mathematical Proofs: Table of Contents