Optimal Search, Learning and Implementation
|Speaker:||Alex Gershkov, Hebrew University of Jerusalem|
|Date:||Wednesday 19 October 2011|
We characterize the incentive compatible, constrained efficient policy ("second-best") in a dynamic matching environment, where impatient, privately informed agents arrive over time, and where the designer gradually learns about the distribution of agents' values. We also derive conditions on the learning process ensuring that the
complete-information, dynamically efficient allocation of resources ("first-best") is incentive compatible. Our analysis reveals and exploits close, formal relations between the problem of ensuring implementable allocation rules in our dynamic allocation problems with incomplete information and learning, and between the classical problem, posed by Rothschild , of finding optimal stopping policies for search that are characterized by a reservation price property.