Zero-Sum Average Semi-Markov Games: Fixed-Point Solutions of the Shapley Equation

From MaRDI portal
Publication:4443070

DOI10.1137/S0363012902408423zbMath1125.91308MaRDI QIDQ4443070

Óscar Vega-Amaya

Publication date: 8 January 2004

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)




Related Items (17)

Zero-sum discounted reward criterion games for piecewise deterministic Markov processesApproximation of noncooperative semi-Markov gamesTurnpike theorems for Markov gamesA probability criterion for zero-sum stochastic gamesPartially observed semi-Markov zero-sum games with average payoffSemi-stationary Equilibrium Strategies in Non-cooperative N-person Semi-Markov GamesSolutions of the average cost optimality equation for Markov decision processes with weakly continuous kernel: the fixed-point approach revisitedNew optimality conditions for average-payoff continuous-time Markov games in Polish spacesZero-sum games for continuous-time jump Markov processes in Polish spaces: discounted payoffsOn a continuous solution to the Bellman-Poisson equation in stochastic gamesLinear Programming and Zero-Sum Two-Person Undiscounted Semi-Markov GamesTwo person zero-sum semi-Markov games with unknown holding times distribution on one side: A discounted payoff criterionA perturbation approach to approximate value iteration for average cost Markov decision processes with Borel spaces and bounded costsZero-sum ergodic semi-Markov games with weakly continuous transition probabilitiesNonzero-sum risk-sensitive average stochastic games: The case of unbounded costsOn zero-sum two-person undiscounted semi-Markov games with a multichain structureZero-sum average cost semi-Markov games with weakly continuous transition probabilities and a minimax semi-Markov inventory problem




This page was built for publication: Zero-Sum Average Semi-Markov Games: Fixed-Point Solutions of the Shapley Equation