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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf6be95b468
DTSTART;TZID=America/Toronto:20241129T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20241129T140000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-rian-neogi-6
SUMMARY:C&O Reading Group - Rian Neogi
CLASS:PUBLIC
DESCRIPTION:TITLE: A O(log log m) prophet inequality for subadditive combin
 atorial\nauctions\n\nSPEAKER:\n Rian Neogi\n\nAFFILIATION:\n University of
  Waterloo\n\nLOCATION:\n MC 6029\n\nABSTRACT:: I will present the paper \"
 An O(log log m) prophet\ninequality for subadditive combinatorial auctions
 \"\, by Dütting\,\nKesselheim\, and Lucier. In the setting of online comb
 inatorial\nauctions\, we have a set of m items and n buyers. Buyers arrive
  one by\none\, and our goal is to irrevocably assign a set of items to eac
 h\nbuyer as they arrive. An item can only be allocated to one buyer. Each\
 nbuyer has a subadditive valuation function\, which assigns a value to\nev
 ery possible subset of items that can be allocated to the buyer. Our\ngoal
  is to maximize the social welfare of the final allocation\, which\nis the
  sum of the valuations of the buyers. The paper provides a O(log\nlog m) p
 rophet inequality for this problem\, beating the previous O(log\nm) barrie
 r. This is the current best known polynomial time algorithm\nfor this prob
 lem.
DTSTAMP:20260403T072737Z
END:VEVENT
END:VCALENDAR