Topic: Distance in graphs as a basis for social choice procedures

Speaker: **Peter J. Slater**, Professor of Mathematics, University
of Alabama in Huntsville

Date and time: Thursday August 2, 2001, 12:00 noon

Location: CoRE Building, Room CoRE 301A, Rutgers University, Piscataway,
NJ

Lunch will be served.

Given a set C of candidates, a set V of voters, and a list of the orderings of the candidates by each voter, a social choice procedure selects a subset S of C as the set of "winners". It is known that a small set of desireable conditions makes it impossible to find a social choice procedure satisfying all of these conditions for an arbitrary set of voter orderings. This talk will address questions related to the desireability of various choice procedures when we are restricted to voter orderings based on distance in graphs.