Home »Mathematics »North Carolina State University » MA 103 - Topics in Contemporary Mathematics

MA 103 - Topics in Contemporary Mathematics

Lecture 13: Apportionment: Hamilton's Method

Download:    MP4 3322 views

Course Description :

Preference Ballots: plurality Borda Count - Plurality with Elimination - Ranking - Weighted Voting Systems - Banzhaf Power Index - Shapley Shubik Power Index - Fair Division: Divider Choose ane Lone Divider - Lone Choose Last Diminisher - Sealed Bids - Method of Markers - Apportionment: Hamilton's Method - Jefferson's, Adam's Method - Webster's Method-Review of Chapters 3 and 4 - Introduction Graph Theory - Euler Paths and Circuits

Eulerization - Hamilton Circuits - Traveling Salesman Problem: Brute Force Method Nearest Neighbor Algorithm - Repetitive Nearest Neighbor Algorithm and Cheapest Link Algorithm - Graph Coloring -Spanning Trees Kruskal's Algorithm - steiner Points - Scheduling, Decreasing Time Algorithm - Critical Path Algorithm - Independent Tasks Bin Packing - Fibonacci Numbers - Gnomons - Linear Growth -Exponential Growth and Compound Interest - Fractals - Final Review

Other Resources :

Citation |

Other Mathematics Courses

» check out the complete list of Mathematics lectures          


Get Your Degree!

Find schools and get information on the program that’s right for you.

Powered by Campus Explorer


Post your Comments