Markov games with frequent actions and incomplete information

We study a two-player, zero-sum, stochastic game with incomplete information on one side in which the players are allowed to play more and more frequently. The informed player observes the realization of a Markov chain on which the payoffs depend, while the non-informed player only observes his opponent's actions. We show the existence of a limit value as the time span between two consecutive stages vanishes; this value is characterized through an auxiliary optimization problem and as the solution of an Hamilton-Jacobi equation.

Data and Resources

Additional Info

Field Value
Source https://hal.science/hal-00843475
Author Cardaliaguet, Pierre, Rainer, Catherine, Rosenberg, Dinah, Vieille, Nicolas
Maintainer CCSD
Last Updated May 10, 2026, 09:38 (UTC)
Created May 10, 2026, 09:38 (UTC)
Identifier hal-00843475
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor CEntre de REcherches en MAthématiques de la DEcision (CEREMADE) ; Université Paris Dauphine-PSL ; Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)
creator Cardaliaguet, Pierre
date 2013-07-11T00:00:00
harvest_object_id 6ddf2f3c-b157-4052-96b5-2658f63b7454
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2026-01-09T00:00:00
relation info:eu-repo/semantics/altIdentifier/arxiv/1307.3365
set_spec type:UNDEFINED