How to win an election using Kneser Graph colourings

Add to your list(s) Download to your calendar using vCal

• Gabriel Gendler (Hebrew University, Jerusalem)
• Thursday 27 February 2025, 14:30-15:30
• MR12.

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

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:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.