We consider repeated games with complete information and imperfect monitoring, where each player is assigned a fixed subset of players and only observes the moves chosen by the players in this subset. This structure is naturally represented by a directed graph. We prove that a generalized folk...

We study a particular case of repeated games with public signals. In the stage game an odd number of players have to choose simultaneously one of two rooms. The players who choose the less crowded room receive a reward of one euro (whence the name “minority game”). The players in the same...

We consider a repeated game where at each stage players simultaneously choose one of the two rooms. The players who choose the less crowded room are rewarded with one euro. The players in the same room do not recognize each other, and between the stages only the current majority room is publicly...

We study a particular case of repeated games with public signals. In the stage game an odd number of players have to choose simultaneously one of two rooms. The players who choose the less crowded room receive a reward of one euro (whence the name “minority game”). Between the stages, only...

We consider a repeated congestion game with imperfect monitoring. At each stage, each player chooses to use some facilities and pays a cost that increases with the congestion. Two versions of the model are examined: a public monitoring setting where agents observe the cost of each available...

We study infinitely repeated anonymous random matching games played by communities of players, who only observe the outcomes of their own matches. It is well known that cooperation can be sustained in equilibrium for the prisoner's dilemma (PD) through grim trigger strategies. Little is known...