Research Article
Constrained Markov games with transition probabilities controlled by a single player
@INPROCEEDINGS{10.4108/smctools.2007.1977, author={Eitan Altman and Saswati Sarkar and Eilon Solan}, title={Constrained Markov games with transition probabilities controlled by a single player}, proceedings={1st International ICST Workshop on Tools for solving Structured Markov Chains}, proceedings_a={SMCTOOLS}, year={2010}, month={5}, keywords={}, doi={10.4108/smctools.2007.1977} }
- Eitan Altman
Saswati Sarkar
Eilon Solan
Year: 2010
Constrained Markov games with transition probabilities controlled by a single player
SMCTOOLS
ICST
DOI: 10.4108/smctools.2007.1977
Abstract
We consider a two-players zero-sum Markov game with side constraints where only one player controls the transition probabilities. We reduce the problem to that of solving an equivalent linear program. Our approach is different than the one previously used to derive such linear programs [4, 5, 9]. We introduce a new type of constraints: the "subsciption constraints" along with standard constraints which we call "realization constraints". We extend the results obtained in [4, 5, 9] to the case where both players have constraints.
Copyright © 2007–2024 ICST