arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1711.04024math.PRcs.GTcs.SIecon.EM
收藏

信息级联有多脆弱?

How fragile are information cascades?

Yuval Peres, Miklos Z. Racz, Allan Sly, Izabella Stuhl

摘要:

众所周知,连续的决策可能导致信息级联。也就是说,当代理人根据他们的私人信息做出决定时,以及观察他们之前的人的行为,那么忽略他们的私人信号并模仿之前个人的行为可能是合理的。如果个体在正确和错误的状态之间做出选择,并且最初的行动是错误的,那么整个级联将是错误的。这个问题是由于级联可以基于非常少的信息。我们表明,如果代理偶尔无视他人的行动,并根据他们的行动只对他们的私人信息,那么错误的级联可以避免。此外,我们研究的最佳渐近速率时,错误概率在时间$t$可以到零。最优策略是参与者在时间$t$以概率$p_{t} = c/t$遵循他们的私人信息,导致$c'/t$的学习率,其中常数$c$和$c'$是显式的。

英文摘要:

It is well known that sequential decision making may lead to information cascades. That is, when agents make decisions based on their private information, as well as observing the actions of those before them, then it might be rational to ignore their private signal and imitate the action of previous individuals. If the individuals are choosing between a right and a wrong state, and the initial actions are wrong, then the whole cascade will be wrong. This issue is due to the fact that cascades can be based on very little information. We show that if agents occasionally disregard the actions of others and base their action only on their private information, then wrong cascades can be avoided. Moreover, we study the optimal asymptotic rate at which the error probability at time $t$ can go to zero. The optimal policy is for the player at time $t$ to follow their private information with probability $p_{t} = c/t$, leading to a learning rate of $c'/t$, where the constants $c$ and $c'$ are explicit.

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

↑