On zero-sum two-person undiscounted semi-Markov games with a multichain structure

DOI10.1017/apr.2017.23zbMath1429.91036OpenAlexW2753132994MaRDI QIDQ5233191

Prasenjit Mondal

Publication date: 16 September 2019

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/apr.2017.23

zbMATH Keywords

data transformationoptimality equationsemi-Markov gamemultichain structurestationary and semistationary strategiesundiscounted payoff

Mathematics Subject Classification ID

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

Related Items (3)

Computing semi-stationary optimal policies for multichain semi-Markov decision processes ⋮ Zero-sum infinite-horizon discounted piecewise deterministic Markov games ⋮ Semi-stationary Equilibrium Strategies in Non-cooperative N-person Semi-Markov Games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On undiscounted semi-Markov decision processes with absorbing states
• Two-sided altruism, Lindahl equilibrium, and Pareto optimality in overlapping generations models
• Zero-sum ergodic semi-Markov games with weakly continuous transition probabilities
• An orderfield property for stochastic games when one player controls transition probabilities
• Stochastic optimal control. The discrete time case
• Zero-sum semi-Markov games in Borel spaces: Discounted and average payoff
• Iterative solution of the functional equations of undiscounted Markov renewal programming
• Linear Programming and Zero-Sum Two-Person Undiscounted Semi-Markov Games
• Uniformization for semi-Markov decision processes under stationary policies
• Zero-sum two-person semi-Markov games
• On the Second Optimality Equation for Semi-Markov Decision Models
• Dynamic Oligopoly with Inventories
• The Asymptotic Theory of Stochastic Games
• The optimality equation in average cost denumerable state semi-Markov decision problems, recurrency conditions and algorithms
• A note on simultaneous recurrence conditions on a set of denumerable stochastic matrices
• Zero-Sum Average Semi-Markov Games: Fixed-Point Solutions of the Shapley Equation
• Zero-Sum Semi-Markov Games
• Ordered Field Property for Semi-Markov Games when One Player Controls Transition Probabilities and Transition Times
• Discrete Dynamic Programming
• ORDERED FIELD PROPERTY IN A SUBCLASS OF FINITE SER-SIT SEMI-MARKOV GAMES
• Markov Renewal Programming by Linear Fractional Programming
• The Big Match
• Multichain Markov Renewal Programs
• On Average Reward Semi-Markov Decision Processes with a General Multichain Structure
• Stochastic Games
• On A Theorem of von Neumann
• Stochastic games

This page was built for publication: On zero-sum two-person undiscounted semi-Markov games with a multichain structure