Undiscounted two-person zero-sum communicating stochastic games

Autor:	Zeynep Müge Avsar, Melike Baykal-Gürsoy
Rok vydání:	2003
Předmět:	Discrete mathematics Combinatorics Computer Science::Computer Science and Game Theory Sequence Stochastic game Convergence (routing) Value (computer science) Finite state State (functional analysis) Action (physics) Mathematics Zero (linguistics)
Zdroj:	Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).
DOI:	10.1109/cdc.1999.832844
Popis:	Consider two-person zero-sum communicating stochastic games with finite state and finite action spaces under the long-run average payoff criterion. A communicating game is irreducible on a restricted strategy space where every pair of action is taken with positive probability. The proposed approach applies Hoffman and Karp's (1996) algorithm for irreducible games successively over a sequence of restricted strategy spaces that gets larger until an /spl epsiv/-optimal stationary policy pair is obtained for any /spl epsiv/>0. This algorithm is convergent for the games that have optimal strategies with a value independent of the initial state.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::cb3f278031c147ea0d2d40163bd31687 https://doi.org/10.1109/cdc.1999.832844 Zobrazit plný text záznamu