dimacs logo color

Events

Event Calendar

« Previous Month

August 2026

Next Month »
Sun Mon Tue Wed Thu Fri Sat
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

Seminar Details

Distance in graphs as a basis for social choice procedures

  • Start Date: August 2, 2001
  • Event Start Time: 12:00 PM
  • Event End Time: 1:00 PM
  • Organizers: Kia Dalili
  • Seminar Series: REU Seminar
  • Presenter(s): Peter J. Slater - University of Alabama in Huntsville
  • Event Location: CoRE 301
  • Abstract: 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.