This talk will explore the paradoxes and possibilities of the mathematics of voting, which seeks to answer, among other questions: If more than two candidates run for office, by what procedure should the winner be chosen to most equitably reflect voter intent? We’ll explore a famous impossibility theorem of Arrow and put the theory into practice by considering the effects various algorithms would have had on real federal, state, and local elections around the country.
Add to Google Calendar · Register for 2019 Festival updates on Eventbrite
This presentation repeats the session taking place from 11:30am – 12:15pm.
