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 > Three-Party Hare Quota > Page 1 of 1
Last Revision: New on 25 Aug 2012

Map Construction: Three-Party Hare Quota Maps

Three-party (S = 3) two-winner (W = 2) scenario: Three parties A, B and C compete in a Hare Quota Party-List election to fill two vacant seats. Let the proportion of voters V preferring A be x, those preferring B be y and those preferring C be z; where x + y + z = 1. Each party nominates a closed list of its own candidates from 1 to W; where here W = 2. The Hare Quota is defined as V/W but the maps use tally shares (t) rather than absolute tallies (T). Hence, for tally shares (where t = T/V), the Hare Quota becomes 1/W and in this scenario it equals 1/2.

All the votes for a particular party initially go to the leading candidate on the party list. Any votes in excess of the quota are then transferred to the second candidate on the list. Every candidate achieving the quota is elected and, if a seat then remains to be filled, the candidate with the highest remaining tally share also wins. Where two candidates tie for this vacancy, this critical tie must be resolved by the random selection of one of them as the winner. Such critical ties define the seat share domain boundaries on the two-party map.

The standard election profile notation and formats are used below to state the tally and tally share for each party.

Two-Way Critical Tie (y = z)
Three-Way Critical Tie (x = y = z)
Two-Way Critical Tie (x - 1/3 = y)
Three-Way Critical Tie (x - 1/3 = y = z)
Two-Way Critical Tie (x = 2y @ z = 0)

As the Hare Quota is a largest remainder method, bar charts can be used to display the distribution of the votes between all the candidates after the final round of counting. These bar charts are useful in determining all the three-way and two-way critical ties for the specific election that are needed to draw the domain boundaries on a three-party map. Five examples are shown opposite.

One obvious three-way tie is when all three parties have an equal vote share of x = y = z = 1/3. It is a critical tie as only two of the three parties will get to fill one seat each from the random tie break.

A two-way critical tie occurs when x exceeds 1/2 and y and z share the remainder equally. Here, A1 gains the first seat outright and either B1 or C1 gets the second following the tie break. This y = z two-way tie continues as x rises by 1/6 from 1/2 to 2/3.

At this point another three-way critical tie occurs; when x - 1/2 = y = z = 1/6. A1 still wins the first seat but here an excess of 1/6 (above the 1/2 quota) is transferred to A2. As B1 and C1 share the remainder, they too each have a tally share of 1/6. Hence, the second seat is randomly awarded to one of these three candidates.

Another two-way critical tie occurs when z now decreases but with A2 and B1 still sharing the remaining tally share. Here, the tie is x - 1/2 = y. This critical tie continues until z = 0 and x = 3y. This point is hence on the edge of the map where x = 3/4 and y = 1/4. A1 still retains the first seat but now A2 and B1 compete in the random tie break for the second seat.

For the two-winner (W = 2) map, both types of the three-way critical ties and both types of the two-way ones have now been identified. For more than two winners, there will be increasing numbers of tied-situation types but for W = 2 there are no further types.

The four specific critical ties shown in the first four bar charts are drawn on the map below left. [The fifth bar chart simply illustrates the case where the second two-way tie line meets the map edge.] The three-way critical ties are shown as small dots. The central one is where candidates A1, B1 and C1 have an equal tally share and the one above is where A2, B1 and C1 have an equal tally share.

The two-way ties are shown as lines since the tally share of the non-tied party can vary (between certain limits). Hence, all points along a two-way tie line represent critical ties. The y = z tie line connects the two three-way tie dots on the map. The x - 1/2 = y tie line emanates from the upper dot and terminates when it reaches the map edge where x = 3y and z = 0. It is important to note that this tie line is at right-angles to the edge of the map since x and y change by the same amount as z varies.

Mapped domain boundaries
Mapped critical ties

On the completed three-party two-winner map above right, all nine two-way critical tie lines are shown. These lines hence form the unique seat share domain boundaries for this election. Each of the four three-way critical ties is at the junction where three two-way tie lines meet. Alternatively stated, each three-way critical tie is where three adjacent domains meet.

Each of the three dashed lines in the map above left bisects the triangle in half and each half is the mirror image of the other. Therefore, the six ranking regions that result from the three bisections are all symmetrical to each other. This hex-symmetry means that only the three-way and two-way critical ties in one of the six ranking regions must be identified; as shown. The others will be of exactly the same type (with just the relevant candidates transposed) and simply be reflections of this initial region. So, flip any base or rotate the map through one third of a cycle and the lines on the map will be identical.

Three-party (S = 3) three-winner (W = 3) scenario: Three parties A, B and C compete in a Hare Quota Party-List election to fill three vacant seats. Let the proportion of voters V preferring A be x, those preferring B be y and those preferring C be z; where x + y + z = 1. Each party nominates a closed list of its own candidates from 1 to W; where here W = 3. The standard election profile notation and formats are used below to state the tally and tally share for each party.

With an extra winner in this scenario, there will be additional critical ties to consider. However, by identifying the two-way ones first, the three-way ones will automatically appear as they result from the junction of three critical two-way ties. For two winners, the quota is 1/2 and the two-way tie lines that meet a map edge at right-angles do so at intervals of a half-quota (1/4) along that map edge. These two-way tie lines have both critical and non-critical sections along them. For three winners, the quota is 1/3 and the two-way tie lines now meet a map edge at right-angles at half-quota intervals of 1/6; as shown in the map below left.

Two-way critical ties
Two-way tie lines

All that needs to be determined now is which sections of a two-way tie line are critical and which are not. This is done using the bar charts as described above. However, due to hex-symmetry, only one of the six ranking regions should be analysed as the other five are mere reflections of it. Once this analysis is complete and the critical two-way ties are known, these resultant domain boundaries can be redrawn as full lines and the non-critical sections deleted; as shown in the map above right.

Three-party (S = 3) multiple-winner (W = W) scenario: Three parties A, B and C compete in a Hare Quota Party-List election to fill W vacant seats. Let the proportion of voters V preferring A be x, those preferring B be y and those preferring C be z; where x + y + z = 1. Each party nominates a closed list of its own candidates from 1 to W. The standard election profile notation and formats are used below to state the tally and tally share for each party.

With more winners, there will be further two-way tie lines to draw on the map. For W winners, the quota is 1/W and these lines should now be drawn at right-angles to a map edge at half-quota intervals along it. As always, bar charts can then be employed to identify the critical and non-critical sections of these two-way tie lines. The critical sections should be shown as full lines and the non-critical ones deleted. Also, as always, only one of the hex-symmetrical regions needs to be analysed to derive the domain boundaries. The complete three-party map for any number of winners can therefore be produced quite easily using this standard approach.

Notice that for any three-party multiple-winner map, the seat share dot is always in the exact centre of its domain due to the multiple half-quota spacing intervals between parallel two-way tie lines. Therefore, any combination of tally shares for the three parties will result in an optimum sharing of the seats awarded to them. The sum of the discrepancy magnitudes (t - s) will always be minimal however voters cast their votes.

In other words, for three-party multiple-winner elections, the Hare Quota Party-List method is identical in outcome to that of an optimally proportional voting (OPV) system. The three-party Hare Quota maps are therefore already constructed and are shown in the corresponding three-party CHPV maps; see the three-party OPV maps on the Evaluations: CHPV Maps 2 and Evaluations: CHPV Maps 3 pages.


Return to main text > Comparisons: Party-List ~ Hare Quota

Refer to > Map Construction: Table of Contents