The speed of sequential asymptotic learning

From MaRDI portal
Publication:1693201

DOI10.1016/J.JET.2017.11.009zbMATH Open1400.91098arXiv1707.02689OpenAlexW2596597071WikidataQ59926985 ScholiaQ59926985MaRDI QIDQ1693201FDOQ1693201


Authors: Wade Hann-Caruthers, Vadim V. Martynov, Omer Tamuz Edit this on Wikidata


Publication date: 11 January 2018

Published in: Journal of Economic Theory (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1707.02689




Recommendations




Cites Work


Cited In (9)





This page was built for publication: The speed of sequential asymptotic learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1693201)