arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1604.07166cs.SIcs.DS
收藏

任意拓扑上的信息级联

Information Cascades on Arbitrary Topologies

Jun Wan, Yu Xia, Liang Li, Thomas Moscibroda

摘要:

本文研究图上的信息级联。在此设置中,图形中的每个节点代表一个人。一个接一个地,每个人都必须根据私人信号以及先前相邻节点做出的决定做出决定。这种信息级联在实践中经常发生,并且已经在完整的图表中进行了研究,每个人都可以偷听到其他参与者的决定。众所周知,信息级联可能是脆弱的,基于非常少的信息,并且它们很可能是错误的。将这个问题推广到任意图,会揭示出有趣的见解。特别是,我们表明,在一个随机图$G(n,q)$,正确的值$q$,节点的数量作出错误的决定是对数的$n$。也就是说,在大$n$的极限中,做出错误决定的参与者的比例趋于零。这很有趣,因为它与两种自然的角落情况形成了对比:空图(每个人都根据他的私人信号独立决定)和完整图(所有节点都能听到所有决定)。在这两种情况下,恒定比例的节点在预期中做出错误的决定。因此,我们的结果表明,虽然太少和太多的信息共享会导致节点做出错误的决策,但对于正确的信息共享量,每个人都可以渐近正确。我们进一步表明,这一结果在随机图是渐近最优的任何拓扑结构,即使节点遵循全局最优的算法策略。基于对随机图的分析,我们探讨了拓扑结构对全局性能的影响,并在层图之间构造了一个最优的确定性拓扑结构。

英文摘要:

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 $G(n,q)$, for the right value of $q$, the number of nodes making a wrong decision is logarithmic in $n$. That is, in the limit for large $n$, the fraction of players that make a wrong decision tends to zero. This is intriguing because it contrasts to the two natural corner cases: empty graph (everyone decides independently based on his private signal) and complete graph (all decisions are heard by all nodes). In both of these cases a constant fraction of nodes make a wrong decision in expectation. Thus, our result shows that while both too little and too much information sharing causes nodes to take wrong decisions, for exactly the right amount of information sharing, asymptotically everyone can be right. We further show that this result in random graphs is asymptotically optimal for any topology, even if nodes follow a globally optimal algorithmic strategy. Based on the analysis of random graphs, we explore how topology impacts global performance and construct an optimal deterministic topology among layer graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑