In this no te we consider the finite-stage Markov game with finitely many states and actions as described by Zachrisson . Zachrisson proves that this game has a value and shows that value and optimal strategies may be determined with a dynamic programming approach. However, he silently assumed that both players would use only Markov strategies. Here we will give a simple proof which shows this restriction to be irrelevant.
|Place of Publication||Eindhoven|
|Publisher||Technische Hogeschool Eindhoven|
|Number of pages||6|
|Publication status||Published - 1975|