BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Combinatorics Seminar
SUMMARY:How to win an election using Kneser Graph colourin
 gs - Gabriel Gendler (Hebrew University\, Jerusale
 m)
DTSTART;TZID=Europe/London:20250227T143000
DTEND;TZID=Europe/London:20250227T153000
UID:TALK227185AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/227185
DESCRIPTION:Arrow's Theorem tells us that there is no rule for
  determining the outcome of an election satisfying
  a series of strong conditions. Eric Maskin propos
 ed relaxing the critical IIA (independence of irre
 levant alternatives) condition to allow for more e
 lections\, and in particular the Borda rule\, wher
 e a candidate gets points for every other candidat
 e she beats in every ballot. We exhibit a number o
 f cases where other rules also exist satisfying Ma
 skin's conditions. In other cases\, we prove that 
 only the Borda rule works. We use a satisfying arg
 ument from the spectral theory of the Boolean slic
 e.\n\n\n
LOCATION:MR12
CONTACT:
END:VEVENT
END:VCALENDAR