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:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cea03d809d9
DTSTART;TZID=America/Toronto:20260302T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260302T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-kostya-pashkovich-sequential-linear
SUMMARY:Tutte Colloquium -Kostya Pashkovich-Sequential Linear Contracts on\
 nMatroids
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Kostya Pashkovich \n\nAFFILIATION:\n University of 
 Waterloo\n\nLOCATION:\n MC 6029\n\nABSTRACT: In this talk\, we present se
 quential contracts under matroid\nconstraints. In the sequential setting\,
  an agent can take actions one\nby one. After each action\, the agent obse
 rves the stochastic value of\nthe action and then decides which action to 
 take next\, if any. At the\nend\, the agent decides what subset of taken a
 ctions to use for the\nprincipal's reward\; and the principal receives the
  total value of this\nsubset as a reward. Taking each action induces a cer
 tain cost for the\nagent. Thus\, to motivate the agent to take actions the
  principal is\nexpected to offer an appropriate contract. A contract descr
 ibes the\npayment from the principal to the agent as a function of the\npr
 incipal's reward obtained through the agent's actions. In this work\,\nwe 
 concentrate on studying linear contracts\, i.e. the contracts where\nthe p
 rincipal transfers a fraction of their total reward to the agent.\nWe assu
 me that the total principal's reward is calculated based on a\nsubset of a
 ctions that forms an independent set in a given matroid. We\nestablish a r
 elationship between the problem of finding an optimal\nlinear contract (or
  computing the corresponding principal's utility)\nand the so called matro
 id (un)reliability problem. Generally\, the\nabove problems turn out to be
  equivalent subject to adding parallel\ncopies of elements to the given ma
 troid. (Joint work with Jacob\nSkitsko and Yun Xing)
DTSTAMP:20260402T165837Z
END:VEVENT
END:VCALENDAR