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:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d12f5d61598
DTSTART;TZID=America/Toronto:20231208T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231208T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-david-wajc
SUMMARY:C&O Reading Group - David Wajc
CLASS:PUBLIC
DESCRIPTION:TITLE: Prophets\, philosophers\, and online algorithms\n\nSPEAK
 ER: \n David Wajc\n\nAFFILIATION:\n Technion\n\nLOCATION:\n MC 6029\n\nABS
 TRACT: In online Bayesian selection problems\, a seller is faced\nwith a s
 tream of buyers arriving sequentially. Each arriving buyer\nmakes\, for ea
 ch item on sale\, a take-it-or-leave-it offer drawn from\nsome known dist
 ribution\, which the seller must immediately either\naccept or decline. I
 t is common to compare the seller's benefit to\nthe optimal offline soluti
 on\, obtained by a \"prophet'' who knows the\nfuture. However\, the seller
  might not even be able to compete with the\noptimal _online_ algorithm\,
  which may be computationally intractable\nto run. In this case the optim
 al online algorithm is obtained by a\n\"philosopher'' with sufficient time
  to think (compute).  In this\ntalk I will discuss some developments on 
 online algorithms efficiently\napproximating this philosopher.
DTSTAMP:20260404T153349Z
END:VEVENT
END:VCALENDAR