The Maxmin of Recursive Games with Incomplete Information on one Side
Published Online:1 Feb 2000https://doi.org/10.1287/moor.25.1.23.15206
References
- R.E.Stearns Repeated Games with Incomplete Information (1995) (MIT Press, Cambridge, MA) Google Scholar
- Recursive games. Ann. Math. Stud. (1957) 39 (Princeton University Press, Princeton, NJ) 47 78 . Contributions to the Theory of Games, 3 Google Scholar
- Repeated games. Proc. Internat. Congress Math.(Berkeley) 1986. (1987) American Mathematical Society, Providence, RI 1528 1577 Crossref, Google Scholar
- Stochastic games. Internat. J. Game Theory (1981) 10 2 53 56 Crossref, Google Scholar
- Repeated Games (1994) 9420 9422 . Parts A, B, and C. CORE D.P. Google Scholar
- Asymptotic properties in dynamic programming. Internat. J. Game Theory (1993) 22 1 11 Crossref, Google Scholar
- Martingales à temps discret (1972) (Masson, Paris, France) Google Scholar
- Big match with lack of information on one side (Part 1). Internat. J. Game Theory (1984) 13 201 255 Crossref, Google Scholar
- Big match with lack of information on one side (Part 2). Internat. J. Game Theory 14 173 204 Crossref, Google Scholar
- , Dutta B. , A note on recursive games. Game Theory and Economic Applications (1992) 389 (Springer Verlag, Berlin) 133 145 Lecture Notes in Economics and Mathematical Systems Google Scholar
- Repeated games of incomplete information: Zero-sum. Handbook of Game Theory with Economic Applications (1992) 1 (Elsevier Science Publishers B.V.) 109 154 Crossref, Google Scholar

