Duality and optimal strategies in the finitely repeated zero-sum games with incomplete information on both sides.

The recursive formula for the value of the zero-sum repeated games with incomplete information on both sides is known for a long time. As it is explained in the paper, the usual proof of this formula is in a sense non constructive : it just claims that the players are unable to guarantee a better payoff than the one prescribed by formula, but it does not indicates how the players can guarantee this amount. In this paper we aim to give a constructive approach to this formula using duality techniques. This will allow us to recursively describe the optimal strategies in those games and to apply these results to games with infinite action spaces.