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 > Maps > Two-Party D'Hondt Method > Page 1 of 1
Last Revision: New on 25 Aug 2012

Map Construction: Two-Party D'Hondt Method Maps

Two-party (S = 2) two-winner (W = 2) scenario: Two parties A and B field two candidates each in a D'Hondt Method Party-List election to fill two vacant seats. Let the proportion of voters V preferring A to B be x and those preferring B to A be y; where x + y = 1. For each party, its candidates are ranked from 1 to W on its closed list; where here W = 2. Candidates are identified below by their party and rank position. The standard election profile notation and formats are used below to state the tally and tally share for each party.

Examples of two-winner ties

Using a party list, each party tally is therefore directly proportional to the share of the vote achieved by that party. The tally share for party A (tA) and for party B (tB) is hence x and y respectively. Linear party stick diagrams can now be drawn for particular values of x and y that specify critical or non-critical ties.

Two examples are shown opposite. The non-critical tie results when the two parties A and B have an equal vote share (where x = y = 1/2) since the two seats are awarded to the prime candidate in each of the two parties. A critical tie occurs when the support for party A is double that for party B; namely where x = 2y (so x = 2/3 and y = 1/3).

Seat ratio A:B domains for two-winner map

Here, A1 is awarded the first vacant seat and the second one goes to either A2 or B1 selected at random. If support for party A was to increase (x > 2/3) then both A candidates would be elected. Similarly, if support for party B exceeded twice that for party A, then both B candidates would win. Otherwise, when each party receives between one third and two thirds of the vote, then each party wins one seat. These three different seat share domains are shown on the two-party two-winner map opposite.

Two-party (S = 2) three-winner (W = 3) scenario: Two parties A and B field three candidates each in a D'Hondt Method Party-List election to fill three vacant seats. Let the proportion of voters V preferring A to B be x and those preferring B to A be y; where x + y = 1. For each party, its candidates are ranked from 1 to W on its closed list; where here W = 3. Candidates are identified below by their party and rank position. The standard election profile notation and formats are used below to state the tally and tally share for each party.

Three-winner critical tiesThree-winner map

With three winners, there will be four seat share domains and three boundaries separating them. Two of the three critical ties that define these boundaries are shown opposite.

The first occurs when both parties have an equal tally share (where x = y) and the second occurs when party A has three times the support received by party B (so x = 3y). The third critical tie (not shown) is the same type as the second one except that all references to A and B are transposed (therefore y = 3x).

The resultant two-party three-winner map is shown opposite. The middle domain boundary marks the 1:1 tally share ratio point on the map. The other two boundaries are located at the 3:1 and 1:3 tally share ratio points; namely at one quarter of the map length from each end. The four seat share domain dots are also included on the map.

Two-party (S = 2) multiple-winner (W = W) scenario: Two parties A and B field W candidates each in a D'Hondt Method Party-List election to fill W vacant seats. Let the proportion of voters V preferring A to B be x and those preferring B to A be y; where x + y = 1. For each party, its candidates are ranked from 1 to W on its closed list. Candidates are identified below by their party and rank position. The standard election profile notation and formats are used below to state the tally and tally share for each party.

For every seat or winner added to an election, there is an additional domain and boundary to be included on the two-party map. For W winners, there are W + 1 domains and W domain boundaries; excluding the two ends of a map. By using the linear party stick diagram approach described above, all the W critical ties needed to define any two-party multiple-winner map can be derived.

For a given D'Hondt method two-party W-winner map, each of the W + 1 domains are always of the same fixed length or size. This length is hence 1/(W + 1). Note the interesting equivalence here with the Hagenbach-Bischoff tally share quota used in the Droop method.

Fully completed two-party maps for up to six winners are presented in the next section of the main text.


Return to main text > Comparisons: Party-List ~ D'Hondt Method

Refer to > Map Construction: Table of Contents