A decomposition approach for undiscounted two-person zero-sum stochastic games

Date

1999-12-07

Author

Baykal-gürsoy, Melike
Avşar, Zeynep Müge

Metadata

Show full item record

Item Usage Stats

29
views

0
downloads

Two-person zero-sum stochastic games are considered under the long-run average expected payoff criterion. State and action spaces are assumed finite. By making use of the concept of maximal communicating classes, the following decomposition algorithm is introduced for solving two-person zero-sum stochastic games: First, the state space is decomposed into maximal communicating classes. Then, these classes are organized in an hierarchical order where each level may contain more than one maximal communicating class. Best stationary strategies for the states in a maximal communicating class at a level are determined by using the best stationary strategies of the states in the previous levels that are accessible from that class. At the initial level, a restricted game is defined for each closed maximal communicating class and these restricted games are solved independently. It is shown that the proposed decomposition algorithm is exact in the sense that the solution obtained from the decomposition procedure gives the best stationary strategies for the original stochastic game.

Subject Keywords

Decomposition, Undiscounted stochastic games

URI

https://hdl.handle.net/11511/81034
http://repository.bilkent.edu.tr/handle/11693/25238
http://repository.bilkent.edu.tr/bitstream/handle/11693/25238/bilkent-research-paper.pdf?sequence=1

Conference Name

38th IEEE Conference on Decision and Control, IEEE Control Systems Society, Institute of Electrical and Electronics Engineers

Collections

Department of Industrial Design, Conference / Seminar

Suggestions

OpenMETU
Core

A decomposition approach for undiscounted two-person zero-sum stochastic games Avşar, Zeynep Müge (Springer Science and Business Media LLC, 1999-06-01) Two-person zero-sum stochastic games are considered under the long-run average expected payoff criterion. State and action spaces are assumed finite. By making use of the concept of maximal communicating classes, the following decomposition algorithm is introduced for solving two-person zero-sum stochastic games: First, the state space is decomposed into maximal communicating classes. Then, these classes are organized in an hierarchical order where each level may contain more than one maximal communicating ...
A Stochastic Maximum Principle for a Markov Regime-Switching Jump-Diffusion Model with Delay and an Application to Finance Savku, Emel; Weber, Gerhard Wilhelm (2018-11-01) We study a stochastic optimal control problem for a delayed Markov regime-switching jump-diffusion model. We establish necessary and sufficient maximum principles under full and partial information for such a system. We prove the existence-uniqueness theorem for the adjoint equations, which are represented by an anticipated backward stochastic differential equation with jumps and regimes. We illustrate our results by a problem of optimal consumption problem from a cash flow with delay and regimes.
A STOCHASTIC APPROACH TO MODEL HOUSING MARKETS: THE US HOUSING MARKET CASE YILMAZ, BİLGİ; Kestel, Sevtap Ayşe (2018-12-01) This study aims to estimate the price changes in housing markets using a stochastic process, which is defined in the form of stochastic differential equations (SDEs). It proposes a general SDEs system on the price structure in terms of house price index and mortgage rate to establish an effective process. As an empirical analysis, it applies a calibration procedure to an SDE on monthly S&P/Case-Shiller US National Home Price Index (HPI) and 30-year fixed mortgage rate to estimate parameters of differentiabl...
An error analysis of iterated defect correction methods for linear differential-algebraic equations Karasözen, Bülent (1996-01-01) Asymptotic expansions of the global error of iterated defect correction (IDeC) techniques based on the implicit Euler method for linear differential-algebraic equations (dae's) of arbitrary index are analyzed. The dependence of the maximum attainable convergence order on the degree of the interpolating polynomial, number of defect correction steps, and on the index of the differential-algebraic system is given. The efficiency of IDeC method and extrapolation is compared on the basis of numerical experiments...
ON FOUNDATIONS OF PARAMETER ESTIMATION FOR GENERALIZED PARTIAL LINEAR MODELS WITH B-SPLINES AND CONTINUOUS OPTIMIZATION TAYLAN, PAKİZE; Weber, Gerhard Wilhelm; Liu, Lian (2010-02-04) Generalized linear models are widely-used statistical techniques. As an extension, generalized partial linear models utilize semiparametric methods and augment the usual parametric terms by a single nonparametric component of a continuous covariate. In this paper, after a short introduction, we present our model in the generalized additive context with a focus on penalized maximum likelihood and on the penalized iteratively reweighted least squares (P-IRLS) problem based on B-splines which is attractive for...

Citation Formats

M. Baykal-gürsoy and Z. M. Avşar, “A decomposition approach for undiscounted two-person zero-sum stochastic games,” Arizona, Amerika Birleşik Devletleri, 1999, p. 576, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/81034.