BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Ical
BEGIN:VTIMEZONE
TZID:Asia/Jerusalem
BEGIN:STANDARD
DTSTART:20181028T020000
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
RDATE:20191027T020000
TZNAME:IST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20190329T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:IDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.82557.field_date.0@mathematics.huji.ac.il
DTSTAMP:20200606T102539Z
CREATED:20190429T100005Z
DESCRIPTION:Date: \n\n11:00am to 1:00pm\n\n\n\n\nSee also: Combinatorics\
, Events & Seminars\, SeminarsLocation: \n\nCS bldg\, room B-500\, Safra c
ampus\n\n\nSpeaker: Shira Zerbib (U. Michigan\, Iowa State University)\nT
itle: Envy-free division of a cake without the “hungry players' assumptio
n \nAbstract:\nThe fair division theorem due to Stromquist (1980) ensures
that under some conditions it is possible to divide a rectangular cake int
o n pieces and assign one piece to each of n players such that no player s
trictly prefers a piece that has not been assigned to him. \nOne of the c
onditions of this theorem\, which has been always considered as crucial\,
is that the players are “hungry': in every partition of the cake\, every p
layer prefers a non-empty piece. \nWe prove that the fair division theorem
holds even if this condition is not satisfied. This was conjectured by Er
el Segal-Halevi (2017)\, who proved it for at most 3 players. The main ste
p in our proof is a new topological lemma which is reminiscent of Sperner’
s lemma: Instead of restricting the labels that can appear on each face of
the simplex\, the lemma considers labelings that enjoy a certain symmetry
on the boundary. \nJoint with Frederic Meunier.\n\n Export\n \n\n \nsu
bscribe iCal
DTSTART;TZID=Asia/Jerusalem:20190513T110000
DTEND;TZID=Asia/Jerusalem:20190513T130000
LAST-MODIFIED:20191104T100204Z
SUMMARY:Combinatorics: Shira Zerbib (U. Michigan\, Iowa State University) '
Envy-free division of a cake without the “hungry players' assumption'
URL;TYPE=URI:https://mathematics.huji.ac.il/event/combinatorics-shira-zerbi
b-u-michigan-iowa-state-university-tba
END:VEVENT
END:VCALENDAR