Abstract
In this no te we consider the finite-stage Markov game with finitely many states and actions as described by Zachrisson [5]. 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.
Original language | English |
---|---|
Place of Publication | Eindhoven |
Publisher | Technische Hogeschool Eindhoven |
Number of pages | 6 |
Publication status | Published - 1975 |
Publication series
Name | Memorandum COSOR |
---|---|
Volume | 7506 |
ISSN (Print) | 0926-4493 |