Discounted Robust Stochastic Games and an Application to Queueing Control

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.

[1]  A. M. Fink,et al.  Equilibrium in a stochastic $n$-person game , 1964 .

[2]  Ruchira S. Datta Using computer algebra to find nash equilibria , 2003, ISSAC '03.

[3]  Dimitris Bertsimas,et al.  Robust game theory , 2006, Math. Program..

[4]  S. Sorin “Big Match” with lack of information on one side (part i) , 1984 .

[5]  Nicolas Vieille,et al.  Stochastic Games with a Single Controller and Incomplete Information , 2002, SIAM J. Control. Optim..

[6]  J. Harsanyi Games with Incomplete Information Played by 'Bayesian' Players, Part III. The Basic Probability Distribution of the Game , 1968 .

[7]  Uri Yechiali,et al.  On Optimal Balking Rules and Toll Charges in the GI/M/1 Queuing Process , 1971, Oper. Res..

[8]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[9]  Shaler Stidham,et al.  Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs , 1989, Oper. Res..

[10]  Robert J. Vanderbei,et al.  LOQO User’s Manual – Version 4.05 , 2006 .

[11]  Massimo Marinacci,et al.  Ambiguous Games , 2000, Games Econ. Behav..

[12]  D. Blackwell,et al.  THE BIG MATCH , 1968, Classics in Game Theory.

[13]  Eitan Altman,et al.  Individual Equilibrium and Learning in Processor Sharing Systems , 1998, Oper. Res..

[14]  Laurent El Ghaoui,et al.  Robust Control of Markov Decision Processes with Uncertain Transition Matrices , 2005, Oper. Res..

[15]  E. Altman Monotonicity of Optimal Policies in a Zero Sum Game: A Flow Control Model , 1994 .

[16]  Matthew J. Sobel,et al.  Optimal Average-Cost Policy for a Queue with Start-Up and Shut-Down Costs , 1969, Oper. Res..

[17]  Bruce S. Davie,et al.  Computer Networks: A Systems Approach , 1996 .

[18]  Ronald Peeters,et al.  StochasticGameSolver: Computing Stationary Equilibria for Stochastic Games , 2004 .

[19]  Steven P. Dirkse,et al.  Mathematical Programs with Equilibrium Constraints : Automatic Reformulation and Solution via Constrained Optimization ∗ , 2002 .

[20]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

[21]  Eitan Altman,et al.  Flow control using the theory of zero sum Markov games , 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.

[22]  I. Gilboa,et al.  Maxmin Expected Utility with Non-Unique Prior , 1989 .

[23]  Kin Chung Lo,et al.  Equilibrium in Beliefs under Uncertainty , 1996 .

[24]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[25]  S. Sorin “Big match” with lack of information on one side (Part II) , 1985 .

[26]  Chelsea C. White,et al.  Markov Decision Processes with Imprecise Transition Probabilities , 1994, Oper. Res..

[27]  O. J. Vrieze Stochastic Games and Stationary Strategies , 2003 .

[28]  Bruce S. Davie,et al.  Computer Networks ISE: A Systems Approach , 2007 .

[29]  J. Nash Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[30]  Daniel P. Heyman,et al.  Optimal Operating Policies for M/G/1 Queuing Systems , 1968, Oper. Res..

[31]  Eitan Altman,et al.  Zero-sum Markov games and worst-case optimal control of queueing systems , 1995, Queueing Syst. Theory Appl..

[32]  Eitan Altman,et al.  Worst-case and Nash routing policies in parallel queues with uncertain service allocations , 1993 .

[33]  Alexander Shapiro,et al.  Minimax analysis of stochastic problems , 2002, Optim. Methods Softw..

[34]  Z. Avsar,et al.  Inventory control under substitutable demand: A stochastic game application , 2002 .

[35]  T. E. S. Raghavan,et al.  Algorithms for stochastic games — A survey , 1991, ZOR Methods Model. Oper. Res..

[36]  J. Filar,et al.  Competitive Markov Decision Processes , 1996 .

[37]  Robert Givan,et al.  Bounded Parameter Markov Decision Processes , 1997, ECP.

[38]  Garud Iyengar,et al.  Robust Dynamic Programming , 2005, Math. Oper. Res..

[39]  S. Zamir,et al.  "Big match" with lack of information on one side (Part II) , 1984 .

[40]  J. K. Satia,et al.  Markovian Decision Processes with Uncertain Transition Probabilities , 1973, Oper. Res..

[41]  S. Kakutani A generalization of Brouwer’s fixed point theorem , 1941 .

[42]  P. Herings,et al.  Stationary Equilibria in Stochastic Games: Structure, Selection and Computation , 2000 .

[43]  John C. Harsanyi,et al.  Games with Incomplete Information Played by "Bayesian" Players, I-III: Part I. The Basic Model& , 2004, Manag. Sci..