Non-Bayesian optimal search and dynamic implementation

► We analyze dynamic allocation problem with impatient agents. ► We show that a non-Bayesian learning procedure leads to the efficient allocation of resources. ► This highlights the role of the learning procedure in dynamic mechanism design problems.