Minmax and maxmin of repeated games with incomplete information

J. F. Mertens*, S. Zamir

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

Abstract

For a class of 2-Person 0-sum repeated games with incomplete information, Aumann/Masch1er [1967] and Stearns [1967] have given a necessary and sufficient condition for the existence of v (the value of the infinitely repeated game). Mertens/Zamir [1971] and Mertens [1971/72] have given the formula (and thus proved the existence) of {Mathematical expression} vn, the limit of the values of the games with n repetitions, for a much larger class of games than that treated by Aumann/Maschler and Steams. In this paper we extend the Aumann-Maschler-Stearns results to the larger family of games studied by Mertens [1971/72].

Original languageEnglish
Pages (from-to)201-215
Number of pages15
JournalInternational Journal of Game Theory
Volume9
Issue number4
DOIs
StatePublished - Dec 1980

Fingerprint

Dive into the research topics of 'Minmax and maxmin of repeated games with incomplete information'. Together they form a unique fingerprint.

Cite this