A note on two-person zero-sum communicating stochastic games
نویسندگان
چکیده
For undiscounted two-person zero-sum communicating stochastic games with finite state and action spaces, a solution procedure is proposed that exploits the communication property, i.e., working with irreducible games over restricted strategy spaces. The proposed procedure gives the value of the communicating game with an arbitrarily small error when the value is independent of the initial state.
منابع مشابه
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 decomposition approach for undiscounted two-person zero-sum stochastic games
Two-person zero-sum stochastic games are considered under the long-run average expected payo ̈ criterion. State and action spaces are assumed ®nite. By making use of the concept of maximal communicating classes, the following decomposition algorithm is introduced for solving twoperson zero-sum stochastic games: First, the state space is decomposed into maximal communicating classes. Then, these ...
متن کاملTwo-person Zero-sum Linear Quadratic Stochastic Differential Games by a Hilbert Space Method
An open-loop two-person zero-sum linear quadratic (LQ for short) stochastic differential game is considered. The controls for both players are allowed to appear in both the drift and diffusion of the state equation, the weighting matrices in the payoff/cost functional are not assumed to be definite/nonsingular, and the cross-terms between two controls are allowed to appear. A forward-backward s...
متن کاملReversibility and Oscillations in Zero-sum Discounted Stochastic Games
We show that by coupling two well-behaved exit-time problems one can construct two-person zero-sum stochastic games with finite state space having oscillating discounted values. This unifies and generalizes recent examples due to Vigeral (2013) and Ziliotto (2013).
متن کاملOn the Equivalence of Linear Programming Problems and Zero-Sum Games
In 1951, Dantzig [3] showed the equivalence of linear programming and two-person zero-sum games. However, in the description of his reduction from linear programming to zero-sum games, he noted that there was one case in which his reduction does not work. This also led to incomplete proofs of the relationship between the Minmax Theorem of game theory and the Strong Duality Theorem of linear pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 34 شماره
صفحات -
تاریخ انتشار 2006