A numerical optimization pesudo-algorithm for two-player zero-sum stochastic games
- 30 November 2020
- journal article
- research article
- Published by Taylor & Francis in Applied Economics
- Vol. 53 (15) , 1729-1742
Abstract
A two-player, zero-sum stochastic game with two variables can be transformed into the coupled control PDEs by a transition probability matrix of the Markov chain. There exist two control variables and two tensity rates ( ) after the transformation that should be solved for. Yuan and Li (Computational Economics, 2018) give a numerical algorithm by the first-order necessary condition, which overcomes several drawbacks of the normal algorithm and describe several numerical experiments demonstrating the performance of their method. However, their method exhibits at least one shortcoming, which is that the final value of the control variables ( ) may exceed the definition domain. This situation means that the ( ) is infeasible and unacceptable. This paper presents a new technique to avoid that situation, and an optimization pseudo-algorithm is designed using the following steps: (i) starting from the given initial points an active-set algorithm is proposed; (ii) the limited memory update technique is used in the algorithm to obtain fast convergence and low storage; (iii) global convergence is established under suitable conditions; and (iv) numerical results are reported to demonstrate that the new algorithm is competitive with the normal algorithm.
Keywords
Funding Information
- the Guangxi Natural Science Key Fund (2017GXNSFDA198046)
- the National Social Science Key Foundation of China (17AJL012)
- the Special Funds for Local Science and Technology Development Guided by the Central Government (ZY20198003)
- the Guangxi Science Fund for Distinguished Young Scholars (2015GXNSFGA139001)
- The National Natural Science Foundation of China (11661009, 71961004, 72061007)
This publication has 16 references indexed in Scilit:
- A Limited Memory BFGS Method for Solving Large-Scale Symmetric Nonlinear EquationsAbstract and Applied Analysis, 2014
- An active set limited memory BFGS algorithm for large-scale bound constrained optimizationMathematical Methods of Operations Research, 2008
- A New Active Set Algorithm for Box Constrained OptimizationSIAM Journal on Optimization, 2006
- Numerical Approximations for Stochastic Differential GamesSIAM Journal on Control and Optimization, 2002
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box ConstraintsSIAM Journal on Optimization, 1998
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimizationMathematics of Computation, 1997
- Risk-Sensitive Control on an Infinite Time HorizonSIAM Journal on Control and Optimization, 1995
- Representations of quasi-Newton matrices and their use in limited memory methodsMathematical Programming, 1994
- H∞-Optimal Control and Related1991
- Stochastic GamesProceedings of the National Academy of Sciences, 1953