BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:How to win an election using Kneser Graph colourings - Gabriel Gen
 dler (Hebrew University\, Jerusalem)
DTSTART:20250227T143000Z
DTEND:20250227T153000Z
UID:TALK227188@talks.cam.ac.uk
CONTACT:103978
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 proposed relaxing the critical IIA (independence of irrelevant alt
 ernatives) condition to allow for more elections\, and in particular the B
 orda rule\, where a candidate gets points for every other candidate she be
 ats in every ballot. We exhibit a number of cases where other rules also e
 xist satisfying Maskin's conditions. In other cases\, we prove that only t
 he Borda rule works. We use a satisfying argument from the spectral theory
  of the Boolean slice.\n\n\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR