Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 2018 | Submitted
Journal Article Open

The speed of sequential asymptotic learning

Abstract

In the classical herding literature, agents receive a private signal regarding a binary state of nature, and sequentially choose an action, after observing the actions of their predecessors. When the informativeness of private signals is unbounded, it is known that agents converge to the correct action and correct belief. We study how quickly convergence occurs, and show that it happens more slowly than it does when agents observe signals. However, we also show that the speed of learning from actions can be arbitrarily close to the speed of learning from signals. In particular, the expected time until the agents stop taking the wrong action can be either finite or infinite, depending on the private signal distribution. In the canonical case of Gaussian private signals we calculate the speed of convergence precisely, and show explicitly that, in this case, learning from actions is significantly slower than learning from signals.

Additional Information

© 2017 Elsevier Inc. Received 7 March 2017, Revised 27 September 2017, Accepted 21 November 2017, Available online 1 December 2017. The authors would like to thank Christophe Chamley, Gil Refael, Peter Sørensen, Philipp Strack, Ye Wang, Ivo Welch and Leeat Yariv for helpful comments and discussions. This work was supported by a grant from the Simons Foundation (#419427, Omer Tamuz).

Attached Files

Submitted - 1707.02689.pdf

Files

1707.02689.pdf
Files (285.0 kB)
Name Size Download all
md5:44ec9ebaec75f7a6e297a853b28ee898
285.0 kB Preview Download

Additional details

Created:
August 21, 2023
Modified:
October 26, 2023