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 > Evaluations > Teaming Thresholds > Page 3 of 6
Last Revision: New on 25 Aug 2012

Evaluations: Teaming Thresholds 3

GV Teaming Thresholds for Clone Set versus Three Candidates

M = 3 map

In this third specific scenario, four candidates A, B, C and D are initially all tied before clone set A nominates its K clones, so here M = 3. By comparing the tallies for A1 and B (or C or D) and then AK and B (or C or D), the above two teaming threshold equations are determined.

Example thresholds are once more presented on the relevant cloning map opposite (so M = 3) for the same values of r as before. Also, for CHPV (r = 1/2) as an example, its upper-left white area (where A1 wins), its lower-right white area (where AK wins) and the intervening grey area (where B, C and D remain tied but beat both A1 and AK) are again highlighted.

GV Teaming Thresholds for Clone Set versus Many Candidates

Teaming Threshold for A1

for A1 to win through teaming.

Teaming Threshold for AK

for AK to win through teaming.

M = 4 map

In this general scenario, many candidates (M in total) are initially all tied with candidate A before clone set A nominates its K clones. By comparing the tally for first A1 and then AK against the one for any of the M candidates, the above two teaming threshold equations result.

On the cloning map opposite, example lines are only drawn here for M = 4. For any given M and r, each teaming threshold is still represented by a straight line. As before, the white and grey areas for teaming and vote splitting respectively are highlighted for CHPV (r = 1/2) only.

As can be seen from the four maps, as M increases, the white areas shrink in size as the grey one correspondingly expands. Except for r → 1, as M tends to infinity, the white areas tend to zero size in the upper-left and lower-right corners. Hence, the chances of successful teaming decrease as M rises or as r falls. Conversely, the chances of inflicting self-harm through vote splitting increase as M rises or as r falls.

In GV, there is no restriction in theory on the minimum or maximum number of candidates that may stand so the strategic nomination of clones cannot be influenced by controlling M. Only the common ratio used in the GV election may be selected to reduce the threat of teaming. The lower the common ratio, then the lower the scope for teaming.


Proceed to next page > Evaluations: Teaming Thresholds 4

Return to previous page > Evaluations: Teaming Thresholds 2