Abstract
In the standard model of observational learning, n agents sequentially decide between two alternatives a or b, one of which is objectively superior. Their choice is based on a stochastic private signal and the decisions of others. Assuming a rational behavior, it is known that informational cascades arise, which cause an overwhelming fraction of the population to make the same choice, either correct or false. Assuming that each agent is able to observe the actions of all predecessors, it was shown by Bikhchandani, Hirshleifer, and Welch [1,2] that, independently of the population size, false informational cascades are quite likely.
In a more realistic setting, agents observe just a subset of their predecessors, modeled by a random network of acquaintanceships. We show that the probability of false informational cascades depends on the edge probability p of the underlying network. As in the standard model, the emergence of false cascades is quite likely if p does not depend on n. In contrast to that, false cascades are very unlikely if p = p(n) is a sequence that decreases with n. Provided the decay of p is not too fast, correct cascades emerge almost surely, benefiting the entire population.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bikhchandani, S., Hirshleifer, D., Welch, I.: A theory of fads, fashion, custom, and cultural change in informational cascades. Journal of Political Economy 100(5), 992–1026 (1992)
Bikhchandani, S., Hirshleifer, D., Welch, I.: Learning from the behavior of others: Conformity, fads, and informational cascades. The. Journal of Economic Perspectives 12(3), 151–170 (1998)
Banerjee, A.V.: A simple model of herd behavior. The. Quarterly Journal of Economics 107(3), 797–817 (1992)
Surowiecki, J.: The Wisdom of Crowds. Anchor (2005)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30(1–7), 107–117 (1998)
Erdős, P., Rényi, A.: On random graphs. Publ. Math. Debrecen 6, 290–297 (1959)
Bollobás, B.: Random graphs, 2nd edn. Cambridge Studies in Advanced Mathematics, vol. 73. Cambridge University Press, Cambridge (2001)
Janson, S., Łuczak, T., Rucinski, A.: Random graphs. In: Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York (2000)
Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
Çelen, B., Kariv, S.: Observational learning under imperfect information. Games Econom. Behav. 47(1), 72–86 (2004)
Banerjee, A., Fudenberg, D.: Word-of-mouth learning. Games Econom. Behav. 46(1), 1–22 (2004)
Gale, D., Kariv, S.: Bayesian learning in social networks. Games Econom. Behav. 45(2), 329–346, Special issue in honor of Rosenthal, R. W. (2003)
Watts, D.J.: A simple model of global cascades on random networks. In: Proc. Natl. Acad. Sci. USA 99(9), 5766–5771(electronic) (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Lorenz, J., Marciniszyn, M., Steger, A. (2007). Observational Learning in Random Networks. In: Bshouty, N.H., Gentile, C. (eds) Learning Theory. COLT 2007. Lecture Notes in Computer Science(), vol 4539. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72927-3_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-72927-3_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72925-9
Online ISBN: 978-3-540-72927-3
eBook Packages: Computer ScienceComputer Science (R0)