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 > Comparisons > Positional Voting > Page 5 of 10
Last Revision: 10 Apr 2023

Comparisons: Positional Voting 5

Bias Indices for Geometric Voting

As GV(r=0) equates to Plurality and GV(r→1) to the Borda Count, evaluating the two bias indices for geometric voting for all valid values of r and N then enables all of the possible GV(r) vectors to be assessed simultaneously. The formula for the nth weighting of a GV(r) vector with N candidates, the standard vector itself and its normalized version are each given below.

The sum Σ of all the normalized preference weightings in the N-candidate GV(r) vector is stated below. The two bias indices PIV and CIV can then easily be calculated using this sum since PIV = 1/Σ and CIV = (Σ-1)/Σ.

Refer to proof CV3
Sigma equation for GV Vectors

The sum and hence the two indices too are all functions of both the common ratio r and the number of candidates N. The table below shows values for the Consensus Index (CIV) for selected values of the common ratio with up to ten candidates.

Consensus Index Table for GV Vectors

With only two candidates (N = 2), CIV = 0 and PIV = 1. Hence here, the GV(any r), Plurality and the Borda Count vectors are all wholly polarized and normalized to simply [1, 0]. All the differing voting systems generate the same election outcome in this special case. As required, GV(r=0) is consistently and extremely polarized regardless of N. For GV(r→1), with an increasing number of candidates this vector becomes ever more consensual. The Borda Count is not wholly consensual but it is always the most consensual vector regardless of N. This is clear from both the table above and the equation for Σ.

This raises the question of whether the CIV index is meaningful if the Borda Count is not wholly consensual for any given election. So, consider the indifference vector where all its preference weightings are identical; namely w1 = wn = wN. Since w1 and wN must have different values, this is actually an invalid voting vector and it cannot be normalized . However, as all its individual preference-pair CIL indices are equal to one, the overall vector CIV is also equal to one irrespective of N. Therefore, the invalid indifference vector - and not the Borda Count one - is the sole wholly-consensual vector. It is however pointless as it cannot discriminate between any of the candidates; hence its name.

Where the common ratio is between its two extreme values, the GV(r) vector also has an intermediate CIV value that increases as r increases. As N increases for any given r, the CIV value also rises but ever slower as the value of N becomes larger. Fortunately, as N becomes very large and tends towards infinity, the equation for the sum of all the weightings can be greatly simplified to Σ = 1/(1-r). The resultant simplified equations for the consensus and polarization indices are shown below.

Refer to proof CV3
Bias Indices for GV Vectors

As N tends to infinity, the two bias indices cease to be functions of N and the CIV converges on a unique value that is equal to the common ratio of the vector. Here the Borda Count vector does indeed approach a CIV of 1 and CHPV (GV with r = 1/2) approaches a CIV and PIV of 1/2. Hence, for every extra candidate that enters the election, CHPV converges asymptotically towards being balanced exactly midway between Plurality and the Borda Count where there is no bias towards either extreme.


Proceed to next page > Comparisons: Positional Voting 6

Return to previous page > Comparisons: Positional Voting 4