| Lecture | Date | Section | Notes | Homework |
|---|---|---|---|---|
| 1 | 8/27 | 1.1-1.2 | Preference Ballots and Plurality Method | |
| 2 | 8/29 | 1.3-1.4 | Borda Count and Instant Run-Off Methods | |
| 3 | 9/1 | 1.5 | The Method of Pairwise Comparisons | |
| 4 | 9/3 | 1.6 | Rankings | |
| 5 | 9/5 | 2.1 | Weighted Voting Systems | |
| 6 | 9/8 | 2.2-2.3 | Banzhaf Power Index | Chapter 1 Homework Due |
| 7 | 9/10 | 2.4 | Shapley-Shubik Power Index | |
| 8 | 9/12 | 2.5 | Applications of Shapley-Shubik | |
| 9 | 9/15 | 3.1-3.3 | Lone Divider Method | Chapter 2 Homework Due |
| 10 | 9/17 | 3.4 | Lone Chooser Method | |
| 11 | 9/19 | 3.5 | Last Diminisher Method | |
| 12 | 9/22 | 3.6-3.7 | Methods of Sealed Bids & Markers | |
| 13 | 9/24 | 4.1-4.3 | Hamilton's Method | Chapter 3 Homework Due |
| 14 | 9/26 | 4.4-4.5 | Jefferson and Madison's Methods | |
| 15 | 9/29 | 4.6 | Webster's Method | |
| 16 | 10/1 | Review | Chapter 4 Homework Due | |
| 17 | 10/3 | Midterm 1 | ||
| 18 | 10/6 | 5.1-5.4 | Introduction to Graphs | |
| 19 | 10/8 | 5.5 | Euler's Theorems | |
| 20 | 10/10 | 5.6 | Fleury's Algorithm | |
| 21 | 10/13 | 5.7 | Eulerizing Graphs | |
| 22 | 10/15 | 6.1-6.2 | Hamiltonian Circuits and Paths | Chapter 5 Homework Due |
| 23 | 10/17 | 6.3-6.4 | Traveling Salesman Problems | |
| 24 | 10/22 | 7.1-7.2 | Trees and Spanning Trees | |
| 25 | 10/24 | 7.3 | Kruskal's Algorithm | Chapter 6 Homework Due |
| 26 | 10/27 | 7.4-7.5 | Shortest Networks | |
| 27 | 10/29 | 8.1-8.3 | Scheduling | |
| 28 | 10/31 | 8.4 -8.5 | Decreasing Time Algorithm | Chapter 7 Homework Due |
| 29 | 11/3 | 8.5-8.7 | Critical Path Algorithm | |
| 30 | 11/5 | Review | ||
| 31 | 11/7 | Midterm 2 | Chapter 8 Homework Due | |
| 32 | 11/10 | TBA | ||
| 33 | 11/12 | TBA | ||
| 34 | 11/14 | TBA | ||
| 35 | 11/17 | TBA | ||
| 36 | 11/19 | TBA | ||
| 37 | 11/21 | TBA | ||
| 38 | 11/24 | TBA | ||
| 39 | 12/1 | TBA | ||
| 40 | 12/3 | TBA | ||
| 41 | 12/5 | TBA | ||
| 42 | 12/8 | TBA |