A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information
نویسندگان
چکیده
We give a policy-improvement type algorithm to locate an optimal pure stationary strategy for discounted stochastic games with perfect information. A graph theoretic motivation for our algorithm is presented as well.
منابع مشابه
Finite-step Algorithms for Single-controller and Perfect Information Stochastic Games
After a brief survey of iterative algorithms for general stochastic games, we concentrate on finite-step algorithms for two special classes of stochastic games. They are Single-Controller Stochastic Games and Perfect Information Stochastic Games. In the case of single-controller games, the transition probabilities depend on the actions of the same player in all states. In perfect information st...
متن کاملWeighted Discounted Stochastic Games with Perfect Information
We consider a two-person zero-sum stochastic game with an innnite time horizon. The payoo is a linear combination of expected total discounted rewards with diierent discount factors. For a model with a countable state space and compact action sets, we characterize the set of persistently optimal (sub-game perfect) policies. For a model with nite state and action sets and with perfect informatio...
متن کامل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...
متن کاملA TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS
In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...
متن کامل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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 95 شماره
صفحات -
تاریخ انتشار 2003