Skip to Main content Skip to Navigation
Journal articles

The Maxmin of Recursive Games with Incomplete Information on one Side

Nicolas Vieille 1, 2 Dinah Rosenberg 3 
1 CECO - Laboratoire d'économétrie de l'École polytechnique
2 GREThA - Groupe de Recherche en Economie Théorique et Appliquée
3 LAGA - Laboratoire Analyse, Géométrie et Applications
Abstract : We prove the existence of the maxmin of zero-sum recursive games with one sided information.
Keywords : Stochastic games recursive games incomplete information maxmin value
Document type :
Journal articles
Complete list of metadata
https://hal-hec.archives-ouvertes.fr/hal-00481429
Contributor : Antoine Haldemann Connect in order to contact the contributor
Submitted on : Thursday, May 6, 2010 - 4:10:42 PM
Last modification on : Saturday, June 25, 2022 - 10:50:47 AM

Links full text

openaccess

Identifiers

Collections

X | UNIV-PARIS13 | HEC | UNIV-PARIS8 | CNRS | LAGA | GRETHA | X-LEEP | X-DEP-ECO | CEPN | GALILE | UNIV-PARIS-LUMIERES | SORBONNE-PARIS-NORD | UNIV-PARIS8-OA

Citation

Nicolas Vieille, Dinah Rosenberg. The Maxmin of Recursive Games with Incomplete Information on one Side. Mathematics of Operations Research, INFORMS, 2000, Vol.25,n°1, pp.23-35. ⟨10.1287/moor.25.1.23.15206⟩. ⟨hal-00481429⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

144