On Zero-Sum Two Person Perfect Information Stochastic Games
Optimization and Control
2023-02-15 v1
Abstract
A zero-sum two person Perfect Information Stochastic game (PISG) under limiting average payoff has a value and both the maximiser and the minimiser have optimal pure stationary strategies. Firstly we form the matrix of undiscounted payoffs corresponding to each pair of pure stationary strategies (for each initial state) of the two players and prove that this matrix has a pure saddle point. Then by using the results by Derman [1] we prove the existence of optimal pure stationary strategy pair of the players. A crude but finite step algorithm is given to compute such an optimal pure stationary strategy pair of the players.
Cite
@article{arxiv.2302.07151,
title = {On Zero-Sum Two Person Perfect Information Stochastic Games},
author = {K. G. Bakshi and S. Sinha},
journal= {arXiv preprint arXiv:2302.07151},
year = {2023}
}
Comments
arXiv admin note: text overlap with arXiv:2201.00179