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:69cf79ffd2dce
DTSTART;TZID=America/Toronto:20250414T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250414T143000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-david-aleman-espinosa
SUMMARY:C&O Reading Group -David Aleman Espinosa
CLASS:PUBLIC
DESCRIPTION:TITLE: Price of information in combinatorial optimization\n\nS
 PEAKER:\n David Aleman Espinosa\n\nAFFILIATION:\n University of Waterloo\n
 \nLOCATION:\n MC 6029\n\nABSTRACT: Pandora's box is a classical example of
  a combinatorial\noptimization problem in which the input is uncertain and
  can only be\nrevealed to us after paying probing prices.\n\nIn this probl
 em we are given a set of n items\, where each i ∈ [n]\nhas a determinist
 ic probing price pi ∈ R+ and a random cost Ci ∈\nR+. The cost Ci is on
 ly revealed after the probing price pi is paid.\nThe goal is to adaptively
  probe a subset of items S ⊆ [n] and select\na probed item in order to m
 inimize the expected selection cost plus\nprobing price: E[min_{i∈S} Ci 
 + ∑_{i∈S} pi]. It is well known\nthat if the costs are independent the
 n the problem admits an efficient\nand simple optimal policy.\n\nIn this t
 alk we discuss a paper by Sahil Singla that studies a\ngeneralization of t
 his model to more general combinatorial\noptimization problems such as mat
 ching\, set cover and facility\nlocation.
DTSTAMP:20260403T082743Z
END:VEVENT
END:VCALENDAR