2000 character limit reached
Discrete-time Zero-Sum Games for Markov chains with risk-sensitive average cost criterion (2201.03790v1)
Published 11 Jan 2022 in math.OC
Abstract: We study zero-sum stochastic games for controlled discrete time Markov chains with risk-sensitive average cost criterion with countable state space and Borel action spaces. The payoff function is nonnegative and possibly unbounded. Under a certain Lyapunov stability assumption on the dynamics, we establish the existence of a value and saddle point equilibrium. Further we completely characterize all possible saddle point strategies in the class of stationary Markov strategies. Finally, we present and analyze an illustrative example.