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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf68460a163
DTSTART;TZID=America/Toronto:20250717T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250717T143000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-rian-neogi-9
SUMMARY:C&O Reading Group -Rian Neogi
CLASS:PUBLIC
DESCRIPTION:TITLE: : Optimal Item Pricing in Online Combinatorial Auctions
 \n\nSPEAKER:\n Rian Neogi\n\nAFFILIATION:\n University of Waterloo\n\nLOCA
 TION:\n MC 6029\n\nABSTRACT: I will present a paper by Correa\, Cristi\, 
 Fielbaum\,\nPollner\, and Weinberg. The paper studies the online combinato
 rial\nauction problem when buyers are interested in sets of size at most d
 .\nThey show that there exist item prices such that the posted price\nmech
 anism under these prices results in an allocation that is\n(d+1)-approxima
 te with respect to the offline benchmark. They show the\nexistence of thes
 e prices through a novel use of Brouwer's fixed point\ntheorem.
DTSTAMP:20260403T071206Z
END:VEVENT
END:VCALENDAR