We characterize belief-free equilibria in infinitely repeated games with incomplete information with N \ge 2 players and arbitrary information structures. This characterization involves a new type of individual rational constraint linking the lowest equilibrium payoffs across players. The...

We consider an example of a Markov game with lack of information on one side, that was first introduced by Renault (2002). We compute both the value and optimal strategies for a range of parameter values.