BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Envy-free divisions of cakes: recent results and open questions
DTSTART:20251029T110000
DTEND:20251029T120000
DTSTAMP:20260922T190124Z
UID:aa42fc227d80336549e3aa803b6bb162fbc63710133d010c87db7c4f
CATEGORIES:Conferences - Seminars
DESCRIPTION:Frederic Meunier https://cermics.enpc.fr/~meuniefr/\nGiven a c
 ake (identified with the interval [0\,1]) and players with different taste
 s\, the envy-free cake-cutting problem asks for a partition of the cake i
 nto connected pieces so that it is possible to assign the pieces to the pl
 ayers without making any of them jealous. The Stromquist--Woodall theorem
  from 1980 ensures the existence of such an envy-free division under mild 
 conditions. Recently\, there has been a surge of interest for this proble
 m from various communities (computer science\, social choice theory\, econ
 omics\, topological combinatorics) and several new versions have been prov
 ed\, e.g.\, the cake can now be poisoned\, or there can be several cakes w
 ith joint preferences\, or the cake can be discrete (i.e.\, it is actually
  a necklace). This talk aims at being a gentle introduction to this fascin
 ating topic\, at presenting the current state of knowledge\, and at review
 ing the main open questions and challenges it offers.
LOCATION:GC B1 10 https://plan.epfl.ch/?room==GC%20B1%2010
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR