Tie-Breakers

Andreas Blass

University of Michigan, Ann Arbor

March 3,
4:15pm
refreshments at 3:45pm
2-338

ABSTRACT 

I plan to talk about both finite and infinite combinatorics of the following situation. A set of voters is to choose between two alternatives. If a majority of the voters chooses one alternative, then their choice wins. But if the vote is a tie, then the decision is made by a "tie-breaker" rule, which specifies which sets of half the voters are winning coalitions.

If the number of voters is finite, the results I'll discuss are mostly about fairness. To what extent can a tie-breaker treat all voters alike? Or even treat equal-sized (small) sets of voters alike?

If the number of voters is infinite, most of the questions from the finite case become trivial, but many new questions arise, which have no analog in the finite case. I'll discuss some questions about which sets of voters might hold the balance of power in "close" elections.


Speaker's Contact Info: ablass(at-sign)umich.edu


Return to seminar home page

Combinatorics Seminar, Mathematics Department, MIT, sara(at-sign)math.mit.edu

Page loaded on February 23, 2004 at 01:53 PM. Copyright © 1998-99, Sara C. Billey. All rights reserved.