BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240301T120000
DTEND;TZID=America/New_York:20240301T130000
DTSTAMP:20260518T191544
CREATED:20240123T192912Z
LAST-MODIFIED:20240227T161522Z
UID:10000675-1709294400-1709298000@cmsa.fas.harvard.edu
SUMMARY:Contract Design in Combinatorial Settings
DESCRIPTION:CMSA Member Seminar \nSpeaker: Tomer Ezra (Harvard CMSA) \nTitle: Contract Design in Combinatorial Settings \nAbstract: We study two combinatorial settings of the contract design problem\, in which a principal wants to delegate the execution of a costly task. In the first setting\, the principal delegates the task to an agent that can take any subset of a given set of unobservable actions\, each of which has an associated cost. The principal receives a reward which is a combinatorial function of the actions taken by the agent. In the second setting\, we study the single-principal multi-agent contract problem\, in which the principal motivates a team of agents to exert effort toward a given task. We design (approximately) optimal algorithms for both settings along with impossibility results for various classes of combinatorial functions. \nThis talk is based on joint works with Paul Duetting\, Michal Feldman\, Thomas Kesselheim and Maya Schlesinger.
URL:https://cmsa.fas.harvard.edu/event/member-seminar-3124/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Member Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Member-Seminar-03.01.2024.png
END:VEVENT
END:VCALENDAR