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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf306352315
DTSTART;TZID=America/Toronto:20230605T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230605T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-ian-dehaan
SUMMARY:C&O Reading Group - Ian DeHaan
CLASS:PUBLIC
DESCRIPTION:TITLE: Extended Formulations for the Colonel Blotto Game\n\nSPE
 AKER:\n Ian DeHaan\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION:\n
  MC 6029\n\nABSTRACT: Suppose you want to replace Doug Ford as premier. To
  beat\nhim\, you need to win as many seats as possible. You have some fini
 te\namount of resources to allocate across all seats - if you spend more\n
 on a seat than Ford does\, you will win that seat. How should you\nallocat
 e your resources to maximize your expected number of seats?
DTSTAMP:20260403T031339Z
END:VEVENT
END:VCALENDAR