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
- Cited by
- Journal of Mathematical Economics, Vol. 123
- 8 March 2022 | Proceedings of the National Academy of Sciences, Vol. 119, No. 11
- 1 January 2022 | Theoretical Economics, Vol. 17, No. 3
- 1 September 2015 | International Journal of Game Theory, Vol. 45, No. 1-2
- The Annals of Probability, Vol. 44, No. 2
- 16 July 2014 | Mathematics of Operations Research, Vol. 40, No. 1
- SIAM Journal on Control and Optimization, Vol. 53, No. 6
- 24 January 2013 | Dynamic Games and Applications, Vol. 3, No. 2
- 29 April 2010 | International Journal of Game Theory, Vol. 40, No. 2
- 16 October 2010 | Dynamic Games and Applications, Vol. 1, No. 1
- 13 November 2009 | International Journal of Game Theory, Vol. 39, No. 1-2
- 1 August 2006 | Mathematics of Operations Research, Vol. 31, No. 3
- 1 February 2005 | Mathematics of Operations Research, Vol. 30, No. 1
- Journal of Optimization Theory and Applications, Vol. 121, No. 1
- SIAM Journal on Control and Optimization, Vol. 43, No. 1
- Israel Journal of Mathematics, Vol. 119, No. 1
Volume 25, Issue 1
February 2000
Pages 1-156
Article Information
Metrics
Information
- Received:March 06, 1998
- Published Online:February 01, 2000
© 2000 INFORMS
Cite as
Dinah Rosenberg, Nicolas Vieille, (2000) The Maxmin of Recursive Games with Incomplete Information on one Side. Mathematics of Operations Research 25(1):23-35.
https://doi.org/10.1287/moor.25.1.23.15206
Keywords
