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 study a repeated game in which one player, the prophet, acquires more information than another player, the follower, about the play that is going to be played. We characterize the optimal amount of information that can be transmitted online by the prophet to the follower, and provide...

The present chapter brings together parts of the theory of polynomial equalities and inequalities used in the theory of stochastic games. The theory can be considered as a theory of polynomial equalities and inequalities over the field of real numbers or the field of real algebraic numbers or...

We study a repeated game with asymmetric information about a dynamic state of nature. In the course of the game, the better informed player can communicate some or all of his information with the other. Our model covers costly and/or bounded communication. We characterize the set of equilibrium...

We prove here the existence of a value (of norm 1) on the spaces ′N A and even ′A N, the closure in the variation distance of the linear space spanned by all games f∘μ, where μ is a non-atomic, non-negative finitely additive measure of mass 1 and f a real-valued function on [0,1] which...