A policy iteration algorithm for zero-sum stochastic games with mean payoff-Reference-Cited by-同舟云学术

A policy iteration algorithm for zero-sum stochastic games with mean payoff

Published:2006-09 Issue:5 Volume:343 Page:377-382
ISSN:1631-073X
Container-title:Comptes Rendus Mathematique
language:en
Short-container-title:Comptes Rendus Mathematique

Author:

Cochet-Terrasson Jean,Gaubert Stéphane

Publisher

Elsevier BV

Subject

General Mathematics

Reference14 articles.

1. Spectral theorem for convex monotone homogeneous maps, and ergodic control;Akian;Nonlinear Anal.,2003

2. H. Bjorklund, S. Sandberg, S. Vorobyov, A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games, Technical Report 05, DIMACS, 2004

3. J. Cochet-Terrasson, Algorithmes d'itération sur les politiques pour les applications monotones contractantes, Thèse, École des Mines de Paris, 2001

4. A constructive fixed point theorem for min–max functions;Cochet-Terrasson;Dynamics and Stability of Systems,1999

5. The complexity of stochastic games;Condon;Inform. Comput.,1992

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approximation of Discounted Minimax Markov Control Problems and Zero-Sum Markov Games Using Hausdorff and Wasserstein Distances;Dynamic Games and Applications;2018-03-19

2. Generic uniqueness of the bias vector of finite zero-sum stochastic games with perfect information;Journal of Mathematical Analysis and Applications;2018-01

3. Policy improvement for perfect information additive reward and additive transition stochastic games with discounted and average payoffs;Journal of Dynamics & Games;2014

4. USING STRATEGY IMPROVEMENT TO STAY ALIVE;International Journal of Foundations of Computer Science;2012-04

5. Multigrid methods for two-player zero-sum stochastic games;Numerical Linear Algebra with Applications;2012-01-17