This paper studies fictitious play in networks of noncooperative two-player games. We show that continuous …-play property. As an extension, we consider networks in which each bilateral game is strategically zero-sum, a weighted potential …, which entails a generalization of Robinson's theorem to arbitrary zero-sum networks. Applications include security games …

This paper studies fictitious play in networks of noncooperative two-person games. We show that continuous … functions do not possess the continuous-time fictitious-play property. As extensions, we consider networks in which each … zero-sum networks. Applications include security games, conflict networks, and decentralized wireless channel selection. …

Our study analyzes theories of learning for strategic interactions in networks. Participants played two of the 2 x 2 … order shown by Selten and Chmura. This result supports our view that learning in networks is different from learning in …

networks. Our results also highlight that information about the users' private beliefs and their social network structure can …

opportunities to identify learning rules, since on networks (compared to, e.g., random matching) more rules differ in terms of their …

links. This means that in the design of networks there exists a trade-off between the speed of learning and accuracy. …

future choices. These considerations motivate a rich research programme on how social networks shape individual and …