Generic uniqueness of the bias vector of finite zero-sum stochastic games with perfect information

DOI10.1016/j.jmaa.2017.07.017zbMath1415.91035arXiv1610.09651OpenAlexW2544731027MaRDI QIDQ2408625

Stéphane Gaubert, Antoine Hochart, Marianne Akian

Publication date: 12 October 2017

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.09651

zbMATH Keywords

zero-sum gamesergodic controlfixed point setsnonexpansive mappingspolicy iteration

Mathematics Subject Classification ID

2-person games (91A05) Stochastic games, stochastic differential games (91A15)

Related Items (2)

A convergent hierarchy of non-linear eigenproblems to compute the joint spectral radius of nonnegative matrices ⋮ An accretive operator approach to ergodic zero-sum stochastic games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ergodicity conditions for zero-sum games
• A zero-sum stochastic game with compact action sets and no asymptotic value
• Policy improvement for perfect information additive reward and additive transition stochastic games with discounted and average payoffs
• Uniform value in dynamic programming
• Triangulations. Structures for algorithms and applications
• Positional strategies for mean payoff games
• The complexity of stochastic games
• Repeated games with absorbing states
• Minimax algebra
• A max version of the Perron-Frobenius theorem
• The complexity of mean payoff games on graphs
• Asymptotic properties of monotonic nonexpansive mappings
• Eigenvalues for a class of homogeneous cone maps arising from max-plus operators
• Max-min representation of piecewise linear functions
• Spectral theorem for convex monotone homogeneous maps, and ergodic control
• The max-plus Martin boundary
• Solving generic nonarchimedean semidefinite programs using stochastic game algorithms
• A policy iteration algorithm for zero-sum stochastic games with mean payoff
• A Tauberian Theorem for Nonexpansive Operators and Applications to Zero-Sum Stochastic Games
• TROPICAL POLYHEDRA ARE EQUIVALENT TO MEAN PAYOFF GAMES
• The Value of Repeated Games with an Informed Controller
• An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms
• Acyclic Gambling Games
• Max-linear Systems: Theory and Algorithms
• The Complexity of Solving Stochastic Games on Graphs
• Invariant Half-Lines of Nonexpansive Piecewise-Linear Transformations
• Some Relations Between Nonexpansive and Order Preserving Mappings
• The Asymptotic Theory of Stochastic Games
• Optimal decision procedures for finite Markov chains. Part II: Communicating systems
• The Perron-Frobenius theorem for homogeneous, monotone functions
• Combinatorial types of tropical eigenvectors
• A constructive fixed point theorem for min-max functions
• Definable Zero-Sum Stochastic Games
• Aubry sets, Hamilton-Jacobi equations, and the Mañé Conjecture
• On Nonterminating Stochastic Games
• Stochastic Games with Perfect Information and Time Average Payoff
• Multichain Markov Renewal Programs
• Properties of Fixed-Point Sets of Nonexpansive Mappings in Banach Spaces
• Stochastic Games
• Stochastic games
• An operator approach to zero-sum repeated games
• A first course on zero-sum repeated games

This page was built for publication: Generic uniqueness of the bias vector of finite zero-sum stochastic games with perfect information