Abstract
AbstractA two-person zero-sum stochastic game with a nonnegative stage reward function is superfair if the value of the one-shot game at each state is at least as large as the reward function at the given state. The payoff in the game is the limit superior of the expected stage rewards taken over the directed set of all finite stop rules. If the game has countable state and action spaces and if at least one of the players has a finite action space at each state, then the game has a value. The value of the stochastic game is obtained by a transfinite algorithm on the countable ordinals.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Control and Optimization
Reference8 articles.
1. Blackwell, D.: Operator solution of infinite $$G_\delta $$ games of imperfect information. In: Anderson, T.W., Athreya, K., Iglehart, D.L. (eds.) Probability, Statistics, and Mathematics: Papers in Honor of Samuel Karlin, pp. 83–87. Academic Press, Cambridge (1989)
2. Dubins, L.E., Savage, L.J.: How to Gamble If You Must: Inequalities for Stochastic Processes. McGraw-Hill, New York (1965). (Dover editions (1976, 2014))
3. Flesch, J., Predtetchinski, A., Sudderth, W.: Positive zero-sum stochastic games with countable state and action spaces. Appl. Math. Optim. 82, 499–516 (2020)
4. Kumar, P.R., Shiau, T.H.: Existence of value and randomized strategies in zero-sum discrete time stochastic dynamic games. SIAM J. Control Optim. 19, 617–634 (1981)
5. Maitra, A., Sudderth, W.: Borel stochastic games with limsup payoff. Ann. Probab. 21, 861–885 (1993)