BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:682e541ab1240
DTSTART;TZID=America/Toronto:20200612T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200612T133000
URL:/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-vishnu-v-narayan
SUMMARY:Combinatorial Optimization Reading Group - Vishnu V. Narayan
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: One Dollar Each Eliminates Envy\n\nSpeaker:
 \n Vishnu V. Narayan\n\nAffiliation:\n McGill University\n\nZoom:\n Contac
 t Sharat Ibrahimpur\n\nABSTRACT:\n\nWe study the fair division of a collec
 tion of $m$ indivisible goods\namongst a set of $n$ agents. Whilst envy-fr
 ee allocations typically do\nnot exist in the indivisible goods setting\, 
 envy-freeness can be\nachieved if some amount of a divisible good (money) 
 is introduced.\n 
DTSTAMP:20250521T223050Z
END:VEVENT
END:VCALENDAR