Do Informational Cascades Happen with Non-myopic Agents?
We consider an environment where players need to decide whether to buy a certain product (or adopt a technology) or not. The product is either good or bad, but its true value is unknown to the players. Instead, each player has her own private information on its quality. Each player can observe the previous actions of other players and estimate the quality of the product. A classic result in the literature shows that in similar settings informational cascades occur where learning stops for the whole network and players repeat the actions of their predecessors. In contrast to this literature, in this work, players get more than one opportunity to act. In each turn, a player is chosen uniformly at random from all players and can decide to buy the product and leave the market or wait. Her utility is the total expected discounted reward, and thus myopic strategies may not constitute equilibria. We provide a characterization of perfect Bayesian equilibria (PBE) with forward-looking strategies through a fixed-point equation of dimensionality that grows only quadratically with the number of players. Using this tractable fixed-point equation, we show the existence of a PBE and characterize PBE with threshold strategies. Based on this characterization we study informational cascades in two regimes. First, we show that for a discount factor {\delta} strictly smaller than one, informational cascades happen with high probability as the number of players N increases. Furthermore, only a small portion of the total information in the system is revealed before a cascade occurs ...
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Competitive Multi-armed Bandit Games for Resource Sharing
In modern resource-sharing systems, multiple agents access limited resources with unknown stochastic conditions to perform tasks. When multiple agents access the same resource (arm) simultaneously, they compete for succe…
Optimal and Myopic Information Acquisition
We consider the problem of optimal dynamic information acquisition from many correlated information sources. Each period, the decision-maker jointly takes an action and allocates a fixed number of observations across the…
Learning in Stackelberg Games with Non-myopic Agents
We study Stackelberg games where a principal repeatedly interacts with a non-myopic long-lived agent, without knowing the agent's payoff function. Although learning in Stackelberg games is well-understood when the agent …
Human-in-the-loop Learning for Dynamic Congestion Games
Today mobile users learn and share their traffic observations via crowdsourcing platforms (e.g., Waze). Yet such platforms simply cater to selfish users' myopic interests to recommend the shortest path, and do not encour…
Strategic Observational Learning
We study learning by privately informed forward-looking agents in a simple repeated-action setting of social learning. Under a symmetric signal structure, forward-looking agents behave myopically for any degrees of patie…