Note on the optimal strategies for the finite-stage Markov game

J. Wal, van der

Research output: Book/ReportReportAcademic

41 Downloads (Pure)


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 languageEnglish
Place of PublicationEindhoven
PublisherTechnische Hogeschool Eindhoven
Number of pages6
Publication statusPublished - 1975

Publication series

NameMemorandum COSOR
ISSN (Print)0926-4493


Dive into the research topics of 'Note on the optimal strategies for the finite-stage Markov game'. Together they form a unique fingerprint.

Cite this