On zero-sum two-person undiscounted semi-Markov games with a multichain structure
DOI10.1017/APR.2017.23zbMATH Open1429.91036OpenAlexW2753132994MaRDI QIDQ5233191FDOQ5233191
Authors: P. 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
Recommendations
data transformationoptimality equationsemi-Markov gamemultichain structurestationary and semistationary strategiesundiscounted payoff
2-person games (91A05) Stochastic games, stochastic differential games (91A15) Stochastic processes (60G99)
Cites Work
- Title not available (Why is that?)
- Stochastic Games
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stochastic games
- Stochastic optimal control. The discrete time case
- The Asymptotic Theory of Stochastic Games
- The Big Match
- Title not available (Why is that?)
- Linear programming and zero-sum two-person undiscounted semi-Markov games
- On undiscounted semi-Markov decision processes with absorbing states
- On the Second Optimality Equation for Semi-Markov Decision Models
- A note on simultaneous recurrence conditions on a set of denumerable stochastic matrices
- Ordered Field Property for Semi-Markov Games when One Player Controls Transition Probabilities and Transition Times
- Discrete Dynamic Programming
- Title not available (Why is that?)
- On Average Reward Semi-Markov Decision Processes with a General Multichain Structure
- Dynamic Oligopoly with Inventories
- Zero-sum ergodic semi-Markov games with weakly continuous transition probabilities
- Zero-sum semi-Markov games in Borel spaces: Discounted and average payoff
- Iterative solution of the functional equations of undiscounted Markov renewal programming
- ORDERED FIELD PROPERTY IN A SUBCLASS OF FINITE SER-SIT SEMI-MARKOV GAMES
- An orderfield property for stochastic games when one player controls transition probabilities
- The optimality equation in average cost denumerable state semi-Markov decision problems, recurrency conditions and algorithms
- Zero-Sum Average Semi-Markov Games: Fixed-Point Solutions of the Shapley Equation
- Zero-Sum Semi-Markov Games
- Multichain Markov Renewal Programs
- Two-sided altruism, Lindahl equilibrium, and Pareto optimality in overlapping generations models
- Uniformization for semi-Markov decision processes under stationary policies
- Markov Renewal Programming by Linear Fractional Programming
- Zero-sum two-person semi-Markov games
- On A Theorem of von Neumann
- Title not available (Why is that?)
Cited In (5)
- Zero-sum infinite-horizon discounted piecewise deterministic Markov games
- Semi-stationary Equilibrium Strategies in Non-cooperative N-person Semi-Markov Games
- Title not available (Why is that?)
- Computing semi-stationary optimal policies for multichain semi-Markov decision processes
- Zero-sum two-person semi-Markov games
This page was built for publication: On zero-sum two-person undiscounted semi-Markov games with a multichain structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233191)