We consider two person zero-sum repeated games with lack of information on one side and with payoffs of special “separable” form. The solutions for these games are reduced to the solutions for families of special transportation type problems with recursive structure. We illustrate our...

We consider a simplified model of finance market where two players carry on direct multistage bidding with risky assets (shares). One of the players (the insider) is informed on the liquidation price of a share, the other player knows its probability distribution only. It is shown that the...

We construct symmetric decompositions of bivariate distributions with given mean values into convex combinations of distributions with supports containing not more than three points and with the same mean values. We use these decompositions for constructing representations of bivariate random...

Supposing that Player 1's computational power is higher than that of Player 2, we give three examples of different kinds of public signal about the state of a two-person zero-sum game with symmetric incomplete information on both sides (both players do not know the state of the game) where...