University of Cambridge > Talks.cam > Combinatorics Seminar > How to win an election using Kneser Graph colourings

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

How to win an election using Kneser Graph colourings

Download to your calendar using vCal

  • UserGabriel Gendler (Hebrew University, Jerusalem)
  • ClockThursday 27 February 2025, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact .

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 alternatives) condition to allow for more elections, and in particular the Borda rule, where a candidate gets points for every other candidate she beats in every ballot. We exhibit a number of cases where other rules also exist satisfying Maskin’s conditions. In other cases, we prove that only the Borda rule works. We use a satisfying argument from the spectral theory of the Boolean slice.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Committee Room, Social and Political Science Average on Sundays: 7291.06451613 kWh Peterhouse Theatre, Trumpington Street, Cambridge

Other talks

External Seminar - Jenn Brophy TBC Caribbean Trip and Cacti Talk TBC Christmas Social Evening & Annual General Meeting Title to be confirmed Loke CTR Seminar Series - Vincent Pasque
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity