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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d14fb2d1c7d
DTSTART;TZID=America/Toronto:20220930T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220930T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-penny-haxell-0
SUMMARY:Tutte Colloquium - Penny Haxell
CLASS:PUBLIC
DESCRIPTION:TITLE: The Integrality Gap for the Santa Claus Problem\n\nSpeak
 er:\n Penny Haxell\n\nAffiliation:\n University of Waterloo\n\nLocation:\n
  MC 5501 or contact Melissa Cambridge for Zoom link\n\nABSTRACT: \n\nIn t
 he max-min allocation problem\, a set of players are to be\nallocated disj
 oint subsets of a set of   indivisible resources\, such\nthat the minimum
  utility among all players is maximized.  In the\nrestricted variant\, al
 so known as the Santa Claus Problem\,  each\nresource (``toy'') has an in
 trinsic positive value\, and each player\n(``child'') covets a subset of t
 he resources. Thus Santa wants to\ndistribute the toys amongst the childre
 n\, while (to satisfy\njealous parents?) wishing to maximize the minimum t
 otal value of toys\nreceived by each child. This problem turns out to have
  a natural\nreformulation in terms of hypergraph matching.
DTSTAMP:20260404T175146Z
END:VEVENT
END:VCALENDAR