Discounted Robust Stochastic Games and an Application to Queueing Control

Authors:
Erim Kardeş/;Fernando Ordó/ò/ez;Randolph W. Hall
Affiliations:
Industrial and Systems Engineering Department, University of Southern California, Los Angeles, California 90089;Industrial and Systems Engineering Department, University of Southern California, Los Angeles, California 90089/ and Industrial Engineering Department, University of Chile, Santiago, Chile;Industrial and Systems Engineering Department, University of Southern California, Los Angeles, California 90089
Venue:
Operations Research
Year:
2011

Citing 10
Cited 1

Competitive Markov decision processes

Competitive Markov decision processes
Robust Convex Optimization

Mathematics of Operations Research
Bounded Parameter Markov Decision Processes

ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Individual Equilibrium and Learning in Processor Sharing Systems

Operations Research
Using computer algebra to find nash equilibria

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
The Price of Robustness

Operations Research
Robust Dynamic Programming

Mathematics of Operations Research
Robust game theory

Mathematical Programming: Series A and B
Robust Control of Markov Decision Processes with Uncertain Transition Matrices

Operations Research
Computer Networks ISE: A Systems Approach

Computer Networks ISE: A Systems Approach

Robust Adversarial Risk Analysis: A Level-k Approach

Decision Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a robust optimization model for n-person finite state/action stochastic games with incomplete information. We consider nonzero sum discounted stochastic games in which none of the players knows the true data of a game, and each player adopts a robust optimization approach to address the uncertainty. We call these games discounted robust stochastic games. Such games allow us to use simple uncertainty sets for the unknown data and eliminate the need to have an a-priori probability distribution over a set of games. We prove the existence of equilibrium points and propose an explicit mathematical programming formulation for an equilibrium calculation. We illustrate the use of discounted robust stochastic games in a single server queueing control problem.