The Maxmin of Recursive Games with Incomplete Information on one Side

References

  • Aumann R. J. , Maschler M. R.E.Stearns Repeated Games with Incomplete Information (1995) (MIT Press, Cambridge, MA) Google Scholar
  • Everett H. Recursive games. Ann. Math. Stud. (1957) 39 (Princeton University Press, Princeton, NJ) 47 78 . Contributions to the Theory of Games, 3 Google Scholar
  • Mertens J. F. Repeated games. Proc. Internat. Congress Math.(Berkeley) 1986. (1987) American Mathematical Society, Providence, RI 1528 1577 CrossrefGoogle Scholar
  • Mertens J. F. , Neyman A. Stochastic games. Internat. J. Game Theory (1981) 10 2 53 56 CrossrefGoogle Scholar
  • Mertens J. F. , Sorin S. , Zamir S. Repeated Games (1994) 9420 9422 . Parts A, B, and C. CORE D.P. Google Scholar
  • Monderer D. , Sorin S. Asymptotic properties in dynamic programming. Internat. J. Game Theory (1993) 22 1 11 CrossrefGoogle Scholar
  • Neveu J. Martingales à temps discret (1972) (Masson, Paris, France) Google Scholar
  • Sorin S. Big match with lack of information on one side (Part 1). Internat. J. Game Theory (1984) 13 201 255 CrossrefGoogle Scholar
  • Sorin S. Big match with lack of information on one side (Part 2). Internat. J. Game Theory 14 173 204 CrossrefGoogle Scholar
  • Thuijsman F. , Vrieze O. J. , Dutta B. , et al. 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
  • Zamir S. Repeated games of incomplete information: Zero-sum. Handbook of Game Theory with Economic Applications (1992) 1 (Elsevier Science Publishers B.V.) 109 154 CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.