Let G = (I,J,g) be a two-person zero-sum game. We examine the two-person zero-sum repeated game G(k,m) in which player 1 and 2 place down finite state automata with k,m states respectively and the payoff is the average per stage payoff when the two automata face off. We are interested in the...

Every two person repeated game of symmetric incomplete information, in which the signals sent at each stage to both players are identical and generated by a state and moves dependent probability distribution on a given finite alphabet, has an equilibrium payoff.

We introduce a model of communication with dynamic state of nature. We rely on entropy as a measure of information, characterize the set of expected empirical distributions that are achievable. We present applications to games with and without common interests.Classification JEL : C61, C73, D82.

Every simple monotonic game in bv'NA is a weighted majority game. Every game v[set membership, variant]bv'NA has a representation where u[set membership, variant]pNA, [mu]i[set membership, variant]NA1 and fi is a sequence of bv' functions with . Moreover, the representation is unique if we...

Correlation of players' actions may evolve in the common course of the play of a repeated game with perfect monitoring (“online correlation”). In this paper we study the concealment of such correlation from a boundedly rational player. We show that “strong” players, i.e., players whose...