Vertical linear complementarity and discounted zero-sum stochastic games with ARAT structure

DOI10.1007/s101070050108zbMath0946.90095OpenAlexW2009376423MaRDI QIDQ1970368

Yanyan Li

Publication date: 21 March 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070050108

zbMATH Keywords

Cottle-Dantzig's algorithmVLCPARAT

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Stochastic games, stochastic differential games (91A15)

Related Items

Fuzzy approximation to an infeasible generalized linear complementarity problem ⋮ On discounted AR-AT semi-Markov games and its complementarity formulations ⋮ Discounted Semi-Markov Games and Algorithms for Solving Two Structured Classes ⋮ Preface: International conference on game theory and optimization, June 6--10, 2016, Indian Institute of Technology Madras, Chennai, India ⋮ Solving subclasses of multi-player stochastic games via linear complementarity problem formulations -- a survey and some new results ⋮ Existence of the least element solution of the vertical block \(Z\)-tensor complementarity problem ⋮ Completely mixed strategies for generalized bimatrix and switching controller stochastic game ⋮ Orderfield property of mixtures of stochastic games ⋮ A Policy Improvement Algorithm for Solving a Mixture Class of Perfect Information and AR-AT Semi-Markov Games ⋮ PIVOTING ALGORITHMS FOR SOME CLASSES OF STOCHASTIC GAMES: A SURVEY