A Policy Improvement Algorithm for Solving a Mixture Class of Perfect Information and AR-AT Semi-Markov Games

DOI10.1142/S0219198920400083zbMath1494.91010OpenAlexW3004819735WikidataQ114978461 ScholiaQ114978461MaRDI QIDQ5149581

Debasish Ghorui, S. K. Neogy, Prasenjit Mondal, Abhijit Kar Gupta

Publication date: 11 February 2021

Published in: International Game Theory Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219198920400083

zbMATH Keywords

perfect informationAR-ATsemi-Markov gamesoptimal pure stationary strategiespolicy improvement algorithm

Mathematics Subject Classification ID

2-person games (91A05) Stochastic games, stochastic differential games (91A15)

Related Items (2)

Discounted Semi-Markov Games and Algorithms for Solving Two Structured Classes ⋮ Zero-sum semi-Markov games with state-action-dependent discount factors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On discounted AR-AT semi-Markov games and its complementarity formulations
• Completely mixed strategies for two structured classes of semi-Markov games, principal pivot transform and its generalizations
• On stochastic games with additive reward and transition structure
• Ordered field property for stochastic games when the player who controls transitions changes from state to state
• Perfect information stochastic games and related classes
• Zero-sum semi-Markov games in Borel spaces: Discounted and average payoff
• A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information
• Vertical linear complementarity and discounted zero-sum stochastic games with ARAT structure
• PIVOTING ALGORITHMS FOR SOME CLASSES OF STOCHASTIC GAMES: A SURVEY
• Algorithms for stochastic games ? A survey
• Zero-sum two-person semi-Markov games
• Existence of p-Equilibrium and Optimal Stationary Strategies in Stochastic Games
• Ordered Field Property for Semi-Markov Games when One Player Controls Transition Probabilities and Transition Times
• Markov-Renewal Programming. I: Formulation, Finite Return Models
• Discrete Dynamic Programming
• ORDERED FIELD PROPERTY IN A SUBCLASS OF FINITE SER-SIT SEMI-MARKOV GAMES
• Stochastic Games

This page was built for publication: A Policy Improvement Algorithm for Solving a Mixture Class of Perfect Information and AR-AT Semi-Markov Games