On Markov games

J. Wal, van der, J. Wessels

Research output: Book/ReportReportAcademic

75 Downloads (Pure)

Abstract

In the paper it is demonstrated, how a dynamic programming approach may be useful for the analysis of Markov games. Markov games with finitely many stages are dealt with extensively. The existence of optimal Markov strategies is proven for finite stage Markov games using a shortcut of a proof by Derman for the analogous result for Markov decision processes. For Markov games with a countably infinite number of stages some results are summarized. Here again the results and the methods of prove have much in common with results and proofs for Markov decision processes. Actually the theory of Markov games is a generalisation. The paper contains short introductions into the theories of matrix games and tree games.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Hogeschool Eindhoven
Number of pages23
Publication statusPublished - 1975

Publication series

NameMemorandum COSOR
Volume7512
ISSN (Print)0926-4493

Fingerprint Dive into the research topics of 'On Markov games'. Together they form a unique fingerprint.

  • Cite this

    Wal, van der, J., & Wessels, J. (1975). On Markov games. (Memorandum COSOR; Vol. 7512). Technische Hogeschool Eindhoven.