Abstract. We analyze discounted repeated games with incomplete information, such that the players' payoffs depend only on their own type (known-own payoff case). We describe an algorithm for finding all equilibrium payoffs in games for which there exists an open set of belief-free equilibria of...

This note provides simple necessary and sufficient conditions for the comparison of information structures in zero-sum games. This solves an open problem of Grossner and Mertens [Gossner, O., Mertens, J.-F., 2001. The value of information in zero-sum games....

We characterize perfect public equilibrium payoffs in dynamic stochastic games, in the case where the length of the period shrinks, but players' rate of time discounting and the transition rate between states remain fixed. We present a meaningful definition of the feasible and individually...

This paper is concerned with the problem of combining a data set that identifies the conditional distribution P (y|x) with one that identifies the conditional distribution P (z|x), in order to identify the regressions E (y|x, middot) identical with [E (y|x, z = j), j element of Z] when the...