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:69cf7a0bea42c
DTSTART;TZID=America/Toronto:20250224T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250224T143000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-jacob-skitsko-2
SUMMARY:C&O Reading Group -Jacob Skitsko
CLASS:PUBLIC
DESCRIPTION:TITLE: Combinatorial Contract Theory\n\nSPEAKER:\n Jacob Skits
 ko\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION:\n MC 6029\n\nABST
 RACTFirst\, I will introduce the contract theory setting.\nAfterwards\, we
 'll survey some approximation and hardness of\napproximation results in th
 e land of combinatorial contract theory.\nWe'll talk briefly about the fla
 vour of techniques used in such\nresults. This should exemplify a few typi
 cal approaches taken in this\nsetting. With any luck\, we'll all find the 
 level of detail pleasant.\nThe main results will be from Multi-Agent Contr
 acts (STOC 23) and On\nThe (In)approximability of Combinatorial Contracts
  (ITCS 24). We may\ntake a dip into results from Multi-Agent Combinatorial
  Contracts (SODA\n25) or other papers\, time permitting.
DTSTAMP:20260403T082755Z
END:VEVENT
END:VCALENDAR