Optimal Dynamic Allocation: Simplicity through Information Design

51 Pages Posted: 2 Jul 2020 Last revised: 10 May 2021

See all articles by Itai Ashlagi

Itai Ashlagi

Stanford University - Department of Management Science & Engineering

Faidra Monachou

Stanford University, Department of Management Science & Engineering

Afshin Nikzad

University of Southern California, Department of Economics

Date Written: February 15, 2020

Abstract

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. We analyze direct-revelation mechanisms that elicit agents’ types and assign them to objects over time. We identify the welfare-maximizing mechanism and show that it can be implemented by a first-come first-served wait-list with deferrals when the marketmaker can design the information disclosed to agents about the objects. The optimal disclosure policy pools adjacent object types.

JEL Classification: C78, D47

Suggested Citation

Ashlagi, Itai and Monachou, Faidra and Nikzad, Afshin, Optimal Dynamic Allocation: Simplicity through Information Design (February 15, 2020). Available at SSRN: https://ssrn.com/abstract=3610386 or http://dx.doi.org/10.2139/ssrn.3610386

Itai Ashlagi

Stanford University - Department of Management Science & Engineering ( email )

473 Via Ortega
Stanford, CA 94305-9025
United States

Faidra Monachou

Stanford University, Department of Management Science & Engineering ( email )

473 Via Ortega
Stanford, CA 94305-9025
United States

Afshin Nikzad (Contact Author)

University of Southern California, Department of Economics ( email )

Los Angeles, CA 90066
United States

HOME PAGE: http://afshin-nikzad.com

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
212
Abstract Views
1,953
rank
174,888
PlumX Metrics