MATH 217 - Voting Theory

This course examines the underlying mathematical structures and symmetries of elections to explain why different voting procedures can give dramatically different outcomes even if no one changes their vote. Other topics may include the Gibbard-Satterthwaite Theorem concerning the manipulation of elections, Arrow’s Impossibility Theorem, measures of voting power, the theory of apportionment, and nonpolitical applications of consensus theory.

Prerequisites
MATH 104 or Permission of Instructor

Area
Math and Computer Science

Connection
20002