Sunteți pe pagina 1din 19

APPORTIONMENT

The Hamilton Method

 The Hamilton Method, one of several methods


of apportionment it is named after Alexander
Hamilton. It was first used to decide the initial
apportionment of the seats in the House of
Representatives in 1790. That apportionment
was vetoed by George Washington and the
House was reapportioned that year according to
the Jefferson Method. The Hamilton Method
did come back into use in 1850 and was then
used until 1900.
The Hamilton Method

 Suppose the total population of all states is p and that are


there are h seats in the house (we call h the house size). That
is, house size is the total number of seats available.

 We define the standard divisor, s, as follows:

total population p
standard divisor  or
s
house size
h
The Hamilton Method

 Next, we define the term quota as follows:

population of state i pi
quota  or q
standard divisor s
The Hamilton Method

• The Hamilton Method of apportionment is as follows:

1. Calculate each state’s quota.


2. Temporarily assign each state it’s lower quota.
3. Starting with state’s having the largest fractional part
in their original quota, distribute any remaining seats,
in order from largest to smallest, until all remaining
seats are distributed.

• The Hamilton Method does not specify what to do in the


case of a tie – if two states had the same fractional part
in their quota - but this is unlikely to occur.
Example #1 - The Hamilton Method

• Consider a country with 4 states and 30 seats in a


congress and populations distributed as in the table
below.
Population

State A 275

State B 383

State C 465

State D 767

Total 1890
Example #1 - The Hamilton Method

• Consider a country with 4 states and 30 seats in a congress and


populations distributed as in the table below.

Population

State A 275

State B 383

We find the standard divisor


State C 465 to be 1890/30 = 63

State D 767

Total 1890
Example #1 - The Hamilton Method

• Consider a country with 4 states and 30 seats in a congress and


populations distributed as in the table below.

Population Quota Quota Lower Add


quota remaining
seat
State A 275 275/63 4.37 4

State B 383 383/63 6.08 6

State C 465 465/63 7.38 7 +1

State D 767 767/63 12.17 12

Total 1890 30 29
Example #1 - The Hamilton Method

• Consider a country with 4 states and 30 seats in a congress and


populations distributed as in the table below.

Populatio Quota Quota Lower Add


n quota remaining
seat
State A 275 275/63 4.37 4
State C has the
largest fractional
State B 383 383/63 6.08 6
part

State C 465 465/63 7.38 7 +1

State D 767 767/63 12.17 12

Total 1890 30 29
Example #1 - The Hamilton Method

• Consider a country with 4 states and 30 seats in a congress and


populations distributed as in the table below.

Populatio Quota Quota Lower Add Final


n quota remaining apportionmen
seat t
State A 275 275/63 4.37 4 4

State B 383 383/63 6.08 6 6

State C 465 465/63 7.38 7 +1 8

State D 767 767/63 12.17 12 12

Total 1890 30 29 30
What is a graph?

A set of points and lines joining these points.


Formally: G=(V,E), V-vertices, E-edges
e6
v1
v4
v3
V2 and v3 are adjacent.
e1 e2 is incident with v2.
e2 e3
e5
v2
v5
e4

11
Presentations of graphs
v3
 Drawing e2
v4
e3

e4 e5
v5
v2
 Incidence matrix
e1 e6
v1

e1 e2 e3 e4 e5 e6
v1 1 0 0 0 0 2
v2 1 1 0 1 0 0
Degree of a vertex,
Regular graph
v3 0 1 1 0 1 0
v4 0 0 0 0 0 0 Hand shaking lemma
v5 0 0 1 1 1 0
12
Presentations of graphs

e2 v3
v4
 Adjacency matrix e3

v1 v2 v3 v4 v5 e4 e5
v5
v2
v1 2 1 0 0 0
e1 e6
v2 1 0 1 0 1 v1

v3 0 1 0 0 2

v4 0 0 0 0 0

v5 0 1 2 0 0

13
Directed Graphs

e2 v3
v4
 Adjacency matrix e3

v1 v2 v3 v4 v5 e4 e5
v5
v2
v1 1 0 0 0 0
e1 e6
v2 1 0 1 0 0 v1

v3 0 0 0 0 1

v4 0 0 0 0 0

v5 0 1 1 0 0

14
Weighted Graphs

2 v3
v4
 Adjacency matrix 2
5
v1 v2 v3 v4 v5 3 v5
v2
v1 3 0 0 0 0
1 3
v2 1 0 2 0 0 v1

v3 0 0 0 0 2

v4 0 0 0 0 0

v5 0 3 3 0 0

15
Graphs as models
 Networks: transportation, roadmaps, computer,
electrical, etc.

16
Graphs as models
 Personnel
assignment
problems.
(assigning people
to jobs, arranging
weddings, finding
appropriate
roommates, etc.)
 Social networks.

17
Graphs as models
 Personnel assignment problems. (assigning people
to jobs, arranging weddings, finding appropriate
roommates, etc.)
 Social networks.
 VLSI chip design. (Planar graphs, visibility,…)
 Geometric polyhedra (Rigidity of structures,)
 Chemistry
 Biology

18
Graphs as models (cont.)

 Ecosystems (food web…)


 Scheduling and timetabling problems
 Puzzles and games
 Many others

19

S-ar putea să vă placă și