"A Strength Test for the Borda Count" by Jade Monroe Waring

Date of Submission

Spring 2019

Academic Programs and Concentrations

Mathematics

Project Advisor 1

John Cullinan

Abstract/Artist's Statement

When running an election with more than two candidates, there are many ways to choose the winner. A famous theorem of Arrow states that the only mathematically fair way to choose is to do so at random. Because this is not a desirable way to choose a winner of an election, many mathematicians have devised alternate ways of aggregating ballots. In my project I consider one of these ways -- the Borda Count, considered to be one of the most desirable from both the point of view of mathematics and economics -- and came up with a method to test the mathematical fairness of an arbitrary voting system against the known fairness of the Borda Count.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

This work is protected by a Creative Commons license. Any use not permitted under that license is prohibited.

Share

COinS