Abstract
Stochastic games under imperfect information are typically computationally intractable even in the discrete-time/discrete-state case considered here. We consider a problem where one player has perfect information. A function of a conditional probability distribution is proposed as an information state. In the problem form here, the payoff is only a function of the terminal state of the system, and the initial information state is either linear or a sum of max-plus delta functions. When the initial information state belongs to these classes, its propagation is finite-dimensional. The state feedback value function is also finite-dimensional, and obtained via dynamic programming, but has a nonstandard form due to the necessity of an expanded state variable. Under a saddle point assumption, Certainty Equivalence is obtained and the proposed function is indeed an information state.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
McEneaney, W. Some Classes of Imperfect Information Finite State-Space Stochastic Games with Finite-Dimensional Solutions. Appl Math Optim 50, 87–118 (2004). https://doi.org/10.1007/s00245-004-0793-y
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00245-004-0793-y