Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-18T15:20:28.467Z Has data issue: false hasContentIssue false

Nonzero-sum games for continuous-time Markov chains with unbounded discounted payoffs

Part of:Game theory

Published online by Cambridge University Press:  14 July 2016

Xianping Guo*
Affiliation:
CINVESTAV and Zhongshan University
Onésimo Hernández-Lerma*
Affiliation:
CINVESTAV
*
∗ Postal address: Department of Mathematics, Zhongshan University, Guangzhou, 510275, PR China. Email address: mcsgxp@zsu.edu.cn
∗∗ Postal address: Department of Mathematics, CINVESTAV IPN, A. Postal 14-740, Mexico DF 07000, Mexico. Email address: ohernand@math.cinvestav.mx
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper, we study two-person nonzero-sum games for continuous-time Markov chains with discounted payoff criteria and Borel action spaces. The transition rates are possibly unbounded, and the payoff functions might have neither upper nor lower bounds. We give conditions that ensure the existence of Nash equilibria in stationary strategies. For the zero-sum case, we prove the existence of the value of the game, and also provide a recursive way to compute it, or at least to approximate it. Our results are applied to a controlled queueing system. We also show that if the transition rates are uniformly bounded, then a continuous-time game is equivalent, in a suitable sense, to a discrete-time Markov game.

Information

Type
Research Papers
Copyright
© Applied Probability Trust 2005