Abstract
We consider repeated two-person zero-sum games in which each player has only partial information about a chance move that takes place at the beginning of the game. Under some conditions on the information pattern it is proved that {Mathematical expression} exists, vn being the value of the game with n repetitions. Two functional equations are given for which {Mathematical expression} is the only simultaneous solutions. We also find the least upper bound for the error term {Mathematical expression}.
Original language | English |
---|---|
Pages (from-to) | 39-64 |
Number of pages | 26 |
Journal | International Journal of Game Theory |
Volume | 1 |
Issue number | 1 |
DOIs | |
State | Published - Dec 1971 |