Delayed perfect monitoring in an infinitely repeated discounted game is modelled by allocating the players to a connected and undirected network. Players observe their immediate neighbors' behavior only, but communicate over time the repeated game's history truthfully throughout the network. The...

Two project leaders (or entrepreneurs) in a network, which captures social relations, recruit players in a strategic, competitive and time-limited process. Each team has an optimal size depending on the project's quality. This is a random variable with a commonly known distribution. Only the...

Imperfect private monitoring in an infinitely repeated discounted Prisoner's Dilemma played on a communication network is studied. Players observe their direct neighbors' behavior only, but communicate strategically the repeated game's history throughout the network. The delay in receiving this...

Two project leaders (or entrepreneurs) in a network, which captures social relations, recruit players in a strategic, competitive and time-limited process. Each team has an optimal size depending on the project's quality. This is a random variable with a commonly known distribution. Only the...

In this paper, we propose a game in which each player decides with whom to establish a costly connection and how much local public good is provided when benefits are shared among neighbors. We show that, when agents are homogeneous, Nash equilibrium networks are nested split graphs....

Imperfect private monitoring in an infinitely repeated discounted Prisoner’s Dilemma played on a communication network is studied. Players observe their direct neighbors’ behavior only, but communicate strategically the repeated game’s history throughout the network. The delay in receiving...