A finite step algorithm via a bimatrix game to a single controller non- zero sum stochastic game

DOI10.1007/BF01581246zbMath0792.90095MaRDI QIDQ2368080

Thirukkannamangai E. S. Raghavan, Andrzej S. Nowak

Publication date: 22 August 1993

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

zbMATH Keywords

bimatrix gameundiscounted stochastic gamesfinitely many states and actionsnon-zero sum discounted stochastic game

Mathematics Subject Classification ID

Stochastic games, stochastic differential games (91A15)

Related Items (6)

On Lemke processibility of LCP formulations for solving discounted switching control stochastic games ⋮ Homotopy methods to compute equilibria in game theory ⋮ Solving subclasses of multi-player stochastic games via linear complementarity problem formulations -- a survey and some new results ⋮ Orderfield property of mixtures of stochastic games ⋮ PIVOTING ALGORITHMS FOR SOME CLASSES OF STOCHASTIC GAMES: A SURVEY ⋮ Pure Equilibrium Strategies for Stochastic Games via Potential Functions

Cites Work

• An orderfield property for stochastic games when one player controls transition probabilities
• Ordered field property for stochastic games when the player who controls transitions changes from state to state
• Linear programming and undiscounted stochastic games in which one player controls transitions
• A Matrix Game Solution of the Single-Controller Stochastic Game
• On stationary equilibria of a single-controller stochastic game
• Algorithms for stochastic games ? A survey
• Discrete Dynamic Programming
• Non-Discounted Denumerable Markovian Decision Models
• Noncooperative Stochastic Games
• Stochastic Games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A finite step algorithm via a bimatrix game to a single controller non- zero sum stochastic game