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:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69f72ede81368
DTSTART;TZID=America/Toronto:20240709T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240709T143000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/ura-seminar-
 kanstantsin-pashkovich
SUMMARY:URA Seminar - Kanstantsin Pashkovich
CLASS:PUBLIC
DESCRIPTION:TITLE: Contracts for Functions Based on Graphs\n\nSPEAKER:\n K
 anstantsin Pashkovich\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION
 :\n MC 5479\n\nABSTRACT: We study contracts for combinatorial problems in
 \nmulti-agent settings. In this problem\, a principal designs a contract\n
 with several agents\, whose actions the principal is unable to observe.\nT
 he principal is able to see only the outcome of the agents'\ncollective ac
 tions\; and the outcome is either a success or failure.\nAll agents that 
 decided to exert effort incur costs\, and so naturally\nall agents expect 
 a fraction of the principal's reward as a\ncompensation. The principal nee
 ds to decide what fraction of their\nreward to give to each agent so that 
 the principal's expected utility\nis maximized.
DTSTAMP:20260503T111750Z
END:VEVENT
END:VCALENDAR