BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.15.18//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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
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
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230404T120000
DTEND;TZID=America/New_York:20230404T130000
DTSTAMP:20260407T194414
CREATED:20230817T171014Z
LAST-MODIFIED:20240228T092930Z
UID:10001240-1680609600-1680613200@cmsa.fas.harvard.edu
SUMMARY:Optimal Dynamic Allocation: Simplicity through Information Design
DESCRIPTION:Member Seminar \nSpeaker: Faidra Monachou \nTitle: Optimal Dynamic Allocation: Simplicity through Information Design \nAbstract: We study dynamic nonmonetary markets where objects are allocated to unit-demand agents with private types. An agent’s value for an object is supermodular in her type and the quality of the object\, and her payoff is quasilinear in her waiting cost. The social planner’s objective is a linear combination of allocative efficiency (i.e.\, the sum of values) and welfare (i.e.\, the sum of payoffs). We identify the optimal mechanism in the class of direct-revelation mechanisms that elicit agents’ types and assign them to objects over time. We show that\, when the social planner can design the information disclosed to the agents about the objects\, the optimal mechanism has a simple implementation: a first-come first-served waitlist with deferrals. In this implementation\, the information disclosed about each object is an interval containing the object quality\, rather than the exact quality. These intervals partition the quality space. We also show that when the planner’s objective weight on welfare increases\, these intervals become coarser\, and optimal disclosure policies less informative. A direct corollary is that mechanisms that achieve higher welfare also induce lower distributional inequality\, in terms of the Lorenz order.
URL:https://cmsa.fas.harvard.edu/event/member-seminar-4423/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Member Seminar
END:VEVENT
END:VCALENDAR