The Maxmin of Recursive Games with Incomplete Information on one Side

DOI10.1287/moor.25.1.23.15206zbMath0981.91004OpenAlexW2146438855MaRDI QIDQ2757620

Nicolas Vieille, Dinah Rosenberg

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: http://publications.ut-capitole.fr/3133/1/markov2006ok.pdf

zbMATH Keywords

stochastic gamesincomplete informationmaxminrecursive games

Mathematics Subject Classification ID

Stochastic games, stochastic differential games (91A15) Multistage and repeated games (91A20)

Related Items (13)

Uniform value in recursive games. ⋮ Recursive games: uniform value, Tauberian theorem and the Mertens conjecture ``\(\mathrm{Maxmin}=\lim v_n=\lim v_\lambda\) ⋮ Zero-sum repeated games: counterexamples to the existence of the asymptotic value and the conjecture \({\max}{\min}=\lim v_{n}\) ⋮ Finite- and Infinite-Horizon Shapley Games with Nonsymmetric Partial Observation ⋮ A zero-sum stochastic game with compact action sets and no asymptotic value ⋮ Value‐based distance between information structures ⋮ The speed of sequential asymptotic learning ⋮ Repeated games with public uncertain duration process ⋮ Zero-sum repeated games: recent advances and new links with differential games ⋮ Infinite sequential games with perfect but incomplete information ⋮ Zero-sum stochastic games with partial information ⋮ Definable Zero-Sum Stochastic Games ⋮ Two-player stochastic games. II: The case of recursive games

This page was built for publication: The Maxmin of Recursive Games with Incomplete Information on one Side