BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:818@lincs.fr
DTSTART;TZID=Europe/Paris:20240306T103000
DTEND;TZID=Europe/Paris:20240306T113000
DTSTAMP:20240307T145311Z
URL:https://www.lincs.fr/events/introduction-to-the-cake-cutting-problem/
SUMMARY:Introduction to the cake cutting problem
DESCRIPTION:The cake cutting problem arises when a cake must be divided
 fairly among individuals who have different preferences. In this
 presentation\, after a brief explanation of the model\, we will introduce
 different definitions of "dividing fairly"\, exploring what it means to
 achieve fairness in such a scenario. Notably\, we will emphasize on
 "envy-freeness" (no one envies the piece of cake allocated to another
 person)\,  especially by showing an algorithm that achieves it when the
 number of individuals is 2 or 3. This will be the occasion to talk about
 the computational complexity of allocation algorithms\, and the theoretical
 bounds obtained so far in the literature.\n
CATEGORIES:Network Theory,Working Group,Youtube
LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\,
 Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20231029T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR