Information from Graphs in Voting Theory

03/10/2015 - 12:15pm
Speaker: 
Karl-Dieter Crisman (Gordon College)
Abstract: 

Those studying the mathematics of voting and choice have long used whatever tools are necessary to explain paradoxes - from dynamical systems to Voronoi diagrams. Recently, graph theory has proved to be quite useful in modeling situations where there are natural symmetry relationships between options in a given choice setup. We will see some recent results (including some due to HMC faculty) answering questions about voting for rank-orderings of candidates and committees. Then we will explore how graphs can be used to answer questions you didn't even know you had about ranking cyclic orders - such as how to seat people at a round table!

Where: 
MDSL 126

Claremont Graduate University | Claremont McKenna | Harvey Mudd | Pitzer | Pomona | Scripps
Proudly Serving Math Community at the Claremont Colleges Since 2007
Copyright © 2018 Claremont Center for the Mathematical Sciences