Information Cascades on Arbitrary Topologies
Jun Wan, Yu Xia, Liang Li, Thomas Moscibroda

TL;DR
This paper analyzes how information cascades behave on arbitrary graph topologies, revealing that with the right level of connectivity, the fraction of wrong decisions can asymptotically approach zero, contrasting with extreme cases.
Contribution
It generalizes the study of information cascades to arbitrary graphs, showing optimal connectivity minimizes wrong decisions and constructing an optimal topology among layer graphs.
Findings
In random graphs, the number of wrong decisions is logarithmic in n.
Both very sparse and very dense graphs lead to a constant fraction of wrong decisions.
Optimal connectivity minimizes wrong decisions asymptotically.
Abstract
In this paper, we study information cascades on graphs. In this setting, each node in the graph represents a person. One after another, each person has to take a decision based on a private signal as well as the decisions made by earlier neighboring nodes. Such information cascades commonly occur in practice and have been studied in complete graphs where everyone can overhear the decisions of every other player. It is known that information cascades can be fragile and based on very little information, and that they have a high likelihood of being wrong. Generalizing the problem to arbitrary graphs reveals interesting insights. In particular, we show that in a random graph , for the right value of , the number of nodes making a wrong decision is logarithmic in . That is, in the limit for large , the fraction of players that make a wrong decision tends to zero. This is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
