A Strength Test for the Borda Count

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