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:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6ac6aceaa31ce
DTSTART;TZID=America/Toronto:20261005T110000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20261005T120000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combopt-read
 ing-group-kanstantsin-pashkovich-nearly-tight
SUMMARY:CombOpt Reading Group | Kanstantsin Pashkovich\, Nearly Tight Upper
 \nBound for Matroid Intersection Prophet Inequality
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n\nKanstantsin Pashkovich\n\nAFFILIATION:\n University
  of Waterloo\n\nROOM:\n MC 6029\n\nABSTRACT: In this talk\, I will go ove
 r the construction that shows a\nlower bound of d/log(d) for the prophet i
 nequality\, where the feasible\nset is the intersection of d matroids. Thi
 s talk is based on the paper\n\"A Nearly Tight Lower Bound for Matroid Int
 ersection Prophet\nInequalities\" by Dimitris Fotakis\, Charalampos Platan
 os\, Thanos\nTolias.
DTSTAMP:20261007T203450Z
END:VEVENT
END:VCALENDAR