A convex programming-based algorithm for mean payoff stochastic games with perfect information
نویسندگان
چکیده
منابع مشابه
A Convex Programming-based Algorithm for Mean Payoff Stochastic Games with Perfect Information
We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V,E), with local rewards r : E → Z, and three types of positions: black VB , white VW , and random VR forming a partition of V . It is a long-standing open question whether a polynomial time algorithm for BWR-games exists, even when |VR| = 0. In fact, a pseudo-polynomial ...
متن کاملPerfect-Information Stochastic Mean-Payoff Parity Games
The theory of graph games is the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic processes, we use 2 2 -player games where some transitions of the game graph are controlled by two adversarial players, the System and the Environment, and the other transitions are determined probabilistically. We consider 212 -player games where the objective of the Sys...
متن کاملA Potential Reduction Algorithm for Ergodic Mean Payoff Stochastic Games with Perfect Information
In this paper, we consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB ∪ VW ∪ VR, E), with local rewards r : E → R, and three types of vertices: black VB, white VW , and random VR. The game is played by two players, White and Black: When the play is at a white (black) vertex v, White (Black) selects an outgoing arc (v, ...
متن کاملA Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB∪VW ∪VR, E), with local rewards r : E → R, and three types of vertices: black VB , white VW , and random VR. The game is played by two players, White and Black. When the play is at a white (black) vertex v, White (Black) selects an outgoing arc (v, u). When the play...
متن کاملPolicy iteration algorithm for zero-sum multichain stochastic games with mean payoff and perfect information
We consider zero-sum stochastic games with finite state and action spaces, perfect information, mean payoff criteria, without any irreducibility assumption on the Markov chains associated to strategies (multichain games). The value of such a game can be characterized by a system of nonlinear equations, involving the mean payoff vector and an auxiliary vector (relative value or bias). We develop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2017
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-017-1140-y