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 > Majority Criteria > EM4
Last Revision: New on 25 Apr 2021

Mathematical Proofs: Majority and Related Criteria

Proof EM4: Effect of Strong versus Broad Support as a function of Common Ratio

Scenario: Four candidates compete in a GV(r) election with fifteen voters. The polarized candidate P receives a minimal majority of first preferences from its eight supporters and last preferences from its seven opponents. The consensus candidate C is awarded a second preference by every voter. Of the two remaining challenger candidates, the leading one L receives all the remaining first preferences and a third preference from the other voters. The trailing challenger candidate T picks up the outstanding lower-value (third and fourth) preferences.

Candidate tallies

Using standard notation and formats, the profile for this GV(r) election scenario is given below.

Using the standard GV weightings (a,ar,ar2,ar3) where a = 1, the tally T for each candidate is derived and stated opposite.

To enable a graph of candidate tallies (T) against the full range of GV common ratios (0 ≤ r < 1) to be plotted (see main text), the table below provides the tally values for selected common ratios. As r=1 is invalid, r=0.99 is employed instead.

Candidate Tallies (T) for selected common ratios (r)
Candidater=0r=0.1r=0.2r=0.3r=0.4r=0.5r=0.6r=0.7r=0.8r=0.9r=0.99
P88.0078.0568.1898.4488.8759.51210.40111.58413.10314.792
C01.5003.0004.5006.0007.5009.00010.50012.00013.50014.850
L77.0807.3207.7208.2809.0009.88010.92012.12013.48014.841
T00.0780.3440.8461.6322.7504.2486.1748.57611.50214.623
GV(r→1) Candidate tallies

The four candidate tallies for a GV election where the common ratio r approaches unity is derived opposite.

For this special case, note that the weightings here form an arithmetic progression with δ as the common difference. Note too that rank positions also form an arithmetic progression but with a common difference of one. Hence, uplifting (or downgrading) a preference by one rank position raises (or lowers) its weighting by δ irrespective of the actual preference. Therefore, for any candidate, the higher its mean rank position is, the higher its tally is too as both changes are always directly proportional. Consequently, the candidate with the highest mean rank position is guaranteed to win any GV election when the common ratio approaches unity (r→1).

From the data opposite and in the above table, the collective rank order of the candidates for a GV election with an extreme or intermediate common ratio is shown below.

The polarized candidate P wins when a low common ratio is employed while the consensus candidate C is victorious when a high one is used instead. As this GV example demonstrates, where CHPV or an intermediate common ratio is employed, a leading challenger candidate L with a powerful combination of both strong and broad support may indeed be capable of simultaneously beating both a polarized candidate and a consensus one in a single-winner election.


Return to main text > Evaluations: Majority Criteria 4

Refer to > Mathematical Proofs: Table of Contents