Abstract
In this paper, we deal with a multicriteria competitive Markov decision process. In the decision process there are two decision makers with a competitive behaviour, so they are usually called players. Their rewards are coupled because depend on the actions chosen by both players in each state of the process. We propose as solution of this game the set of Pareto-optimal security strategies for any of the players in the original problem. We show that this solution set can be obtained as the efficient solution set of a multicriteria linear programming problem.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Manuscript received: October 2001/Final version received: January 2002
Rights and permissions
About this article
Cite this article
Rodrı´guez-Chı´a, A., Puerto, J. & Fernández, F. A multicriteria competitive Markov decision process. Mathematical Methods of OR 55, 359–369 (2002). https://doi.org/10.1007/s001860200194
Published:
Issue Date:
DOI: https://doi.org/10.1007/s001860200194