Fair Elections Notes
Section 1.1: An Electron Activity
1) Preference Ballot
a) allows voters to rank their choices from first to last
2) Preference Schedule
a) Represents the preferences of one or more individuals
b) Lists preferences from first to last
c

4.2: Critical Paths
1. The Critical Path is the path with the longest time.
a. The least amount of time that it takes to complete all of the tasks in the project
corresponds to the time it takes to complete the longest path (critical path)
2. An Earliest-

4.6: Graph Coloring
1. Coloring the Graph is the process of labeling the vertices of a graph, giving the same
label to events that can happen at the same time.
2. A label is anything that can be used to identify the event/object a vertex represents.
Label

Flow Networks
1
2
Weighted graph where the numbers represent the capacity of flow an edge can handle
Weights determine the maximum flow that can leave a vertex. If more goes to a vertex
3
than can leave the vertex, some of the flow is wasted
The maximum f

Fair Division Notes
2.2 Estate Division
Discrete Division when the objects cannot be meaningfully separated into pieces
Continuous Division when the objects can be meaningfully separated into pieces.
o The pieces can also be separated, hence the term cont