Optimal Search, Learning and Implementation
Alex Gershkov and
Benny Moldovanu ()
Discussion Paper Series from The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem
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 .
Pages: 36 pages
New Economics Papers: this item is included in nep-cta and nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1) Track citations by RSS feed
Downloads: (external link)
Journal Article: Optimal search, learning and implementation (2012)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:huj:dispap:dp543
Access Statistics for this paper
More papers in Discussion Paper Series from The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem Contact information at EDIRC.
Bibliographic data for series maintained by Michael Simkin ().