|
||||
|
||||
Noisytalk.com: Broadcasting Opinions in a Noisy EnvironmentAnat R. AdmatiStanford Graduate School of Business Paul C. PfleidererStanford Graduate School of Business December 2000 Stanford GSB Working Paper Abstract: This paper is motivated by the vast quantity of public broadcasting that occurs on the internet, e.g., customer reviews of products on various sites. We analyze a model of information transmission in which a sender attempts to communicate information to a population of receivers using a finite number of messages. Noise in this process arises from the possibility that the sender is uninformed. Receivers are rational in interpreting the message they observe; the sender is either rational or overconfident concerning the informativeness of his signal. We show that if the sender is rational, there is an equilibrium outcome that is informationally efficient, but this equilibrium may be neither unique nor symmetric. This is true even when the underlying distributions are symmetric. If the sender is overconfident, he tends to exaggerate, and equilibrium involves extreme messages being sent with a relatively high likelihood. Overconfidence generally reduces the number of equilibria, and this might lead to an improvement in the informational efficiency of the equilibrium. We analyze the model with costless as well as with costly broadcasting, and show that with costly broadcasting equilibrium may involve a subset of the messages that are not used in equilibrium. Our results are generally consistent with the casual empirical observations such as that the customer ratings on the internet have a highly asymmetric distribution, with a preponderance of extreme messages, and with some available messages essentially unused.
Number of Pages in PDF File: 43 Keywords: Asymmetric Information, Internet, Efficiency of Communication, Overconfidence JEL Classification: D00, D80 working papers seriesDate posted: January 8, 2001Suggested CitationContact Information
|
|
|||||||||||||||||||||||||||
© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.
FAQ
Terms of Use
Privacy Policy
Copyright
This page was processed by apollo5 in 0.500 seconds