A Folk Theorem for Indefinitely Repeated Network Games

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autore principale: Benso, Andrea
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866913939896401920
author Benso, Andrea
author_facet Benso, Andrea
contents We consider a repeated game in which players, considered as nodes of a network, are connected. Each player observes her neighbors' moves only. Thus, monitoring is private and imperfect. Players can communicate with their neighbors at each stage; each player, for any subset of her neighbors, sends the same message to any player of that subset. Thus, communication is local and both public and private. Both communication and monitoring structures are given by the network. The solution concept is perfect Bayesian equilibrium. In this paper we show that a folk theorem holds if and only if the network is 2-connected for any number of players.
format Preprint
id arxiv_https___arxiv_org_abs_2507_10148
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle A Folk Theorem for Indefinitely Repeated Network Games
Benso, Andrea
Theoretical Economics
We consider a repeated game in which players, considered as nodes of a network, are connected. Each player observes her neighbors' moves only. Thus, monitoring is private and imperfect. Players can communicate with their neighbors at each stage; each player, for any subset of her neighbors, sends the same message to any player of that subset. Thus, communication is local and both public and private. Both communication and monitoring structures are given by the network. The solution concept is perfect Bayesian equilibrium. In this paper we show that a folk theorem holds if and only if the network is 2-connected for any number of players.
title A Folk Theorem for Indefinitely Repeated Network Games
topic Theoretical Economics
url https://arxiv.org/abs/2507.10148