Discounted Robust Stochastic Games and an Application to Queueing Control

References

• Aghassi M., Bertsimas D. Robust game theory. Math. Programming, Ser. B (2006) 107(1):231–273Crossref, Google Scholar
• Altman E. Flow control using the theory of zero-sum Markov games. IEEE Trans. Automatic Control (1994a) 39(4):814–818Crossref, Google Scholar
• Altman E. Monotonicity of optimal policies in a zero sum game: A flow control model. Advances in Dynamic Games and Applications (1994b) 1(Birkhäuser, Boston) Crossref, Google Scholar
• Altman E., Hordijk A. Zero-sum Markov games and worst-case optimal control of queueing systems. QUESTA (1995) 21(3):415–447Google Scholar
• Altman E., Shimkin N. Worst-case and Nash routing policies in parallel queues with uncertain service allocations. (1993) . Technical report, IMA Preprint No. 1120, Institute for Mathematics and Applications, University of Minnesota, MinneapolisGoogle Scholar
• Altman E., Shimkin N. Individually optimal dynamic routing in a processor sharing system: Stochastic game analysis. Oper. Res. (1998) 46(6):776–784Link, Google Scholar
• Aumann R. J., Maschler M. B. Repeated games of incomplete information: The zero-sum extensive case. (1968) . Technical report, U.S. Arms Control and Disarmament Agency, ST-143, Washington, DC, chapter III, 37116Google Scholar
• Avşar Z. M., Gürsoy M. B. Inventory control under substitutable demand: A stochastic game application. Naval Res. Logist. (2002) 49(4):359–375Crossref, Google Scholar
• Bagnell J., Ng A., Schneider J. Solving uncertain Markov decision problems. (2001) . Technical Report CMU-RI-TR-01-25, Robotics Institute, Carnegie Mellon University. PittsburghGoogle Scholar
• Ben-Tal A., Nemirovski A. Robust convex optimization. Math. Oper. Res. (1998) 23(4):769–805Link, Google Scholar
• Bertsimas D., Sim M. The price of robustness. Oper. Res. (2004) 52(1):35–53Link, Google Scholar
• Blackwell D., Ferguson T. The big match. Ann. Math. Statist. (1968) 39(1):159–163Crossref, Google Scholar
• Datta R. Using computer algebra to find Nash equilibria. Intl. Symp. Symb. Alg. Comp. (2003) (ACM Press, New York) 74–79Crossref, Google Scholar
• Filar J., Vrieze K.Competitive Markov Decision Processes (1997) (Springer-Verlag, New York) Google Scholar
• Fink A. M. Equilibrium in a stochastic n-person game. J. Sci. Hiroshima Univ., Ser. A–I (1964) 28(1):89–93Google Scholar
• Gilboa I., Schmeidler D. Maxmin expected utility with a nonunique prior. J. Math. Econom. (1989) 18(2):141–153Crossref, Google Scholar
• Givan R., Leach S., Dean T. Bounded parameter Markov decision processes. Fourth Eur. Conf. Planning (1997) (Springer-Verlag, London) 234–246Crossref, Google Scholar
• Harsanyi J. C. Games with incomplete information played by “Bayesian” players, part I. The basic model. Management Sci. (1967) 14(3):159–182Link, Google Scholar
• Harsanyi J. C. Games with incomplete information played by “Bayesian” players, part II. Bayesian equilibrium points. Management Sci. (1968a) 14(5):320–324Link, Google Scholar
• Harsanyi J. C. Games with incomplete information played by “Bayesian” players, part III. The basic probability distribution of the game. Management Sci. (1968b) 14(7):486–502Link, Google Scholar
• Herings P. J., Peeters R. J. A. P. Stationary equilibria in stochastic games: Structure, selection, and computation. J. Econom. Theory (2004) 118(1):32–60Crossref, Google Scholar
• Heyman D. P. Optimal operating policies for M/G/1 queuing systems. Oper. Res. (1968) 16(2):362–382Link, Google Scholar
• Iyengar G. Robust dynamic programming. Math. Oper. Res. (2005) 30(2):1–21Link, Google Scholar
• Kakutani S. A generalization of Brouwer's fixed point theorem. Duke Math. J. (1941) 8(3):457–459Crossref, Google Scholar
• Lo K. C. Equilibrium in beliefs under uncertainty. J. Econom. Theory (1996) 71(2):443–484Crossref, Google Scholar
• Marinacci M. Ambiguous games. Games Econom. Behav. (2000) 31(2):191–219Crossref, Google Scholar
• Nash J. Equilibrium points in n-person games. Proc. Natl. Acad. Sci. USA (1950) 36(1):48–49Crossref, Google Scholar
• Nilim A., El Ghaoui L. Robust control of Markov decision processes with uncertain transition matrices. Oper. Res. (2005) 53(5):780–798Link, Google Scholar
• Peterson L. L.Computer Networks: A Systems Approach (2007) (Morgan Kaufmann Publishers)Google Scholar
• Rosenberg D., Solan E., Vieille N. Stochastic games with a single controller and incomplete information. SIAM J. Control Optim. (2004) 43(1):86–110Crossref, Google Scholar
• Satia J. K., Lave R. L. Markov decision processes with uncertain transition probabilities. Oper. Res. (1973) 21(3):728–740Link, Google Scholar
• Shapiro A., Kleywegt A. J. Minimax analysis of stochastic problems. Optim. Methods Software (2002) 17(1):523–592Crossref, Google Scholar
• Shapley L. S. Stochastic games. Proc. Natl. Acad. Sci. USA (1953) 39(10):1095–1100Crossref, Google Scholar
• Sobel M. J. Optimal average-cost policy for a queue with start-up and shut-down costs. Oper. Res. (1969) 17(1):145–162Link, Google Scholar
• Sorin S. Big match with lack of information on one side I. Internat. J. Game Theory (1984) 13(4):201–255Crossref, Google Scholar
• Sorin S. Big match with lack of information on one side II. Internat. J. Game Theory (1985) 14(3):173–204Crossref, Google Scholar
• Stidham S., Weber R. R. Monotonic and insensitive optimal policies for control of queues with undiscounted costs. Oper. Res. (1989) 37(4):611–625Link, Google Scholar
• Vanderbei R. J. LOQO user's manual—Version 4.05. (2006) . Technical report, Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJGoogle Scholar
• Vrieze O. J., Neyman A., Sorin S. Stochastic games and stationary strategies. Stochastic games and applications. Proc. NATO Adv. Study Inst., NATO Sci. Ser. C (2004) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Google Scholar
• White C. C., Eldeib H. K. Markov decision processes with imprecise transition probabilities. Oper. Res. (1994) 42(4):739–749Link, Google Scholar
• Yechiali U. On optimal balking rules and toll charges in the GI/M/1 queuing process. Oper. Res. (1971) 19(2):349–370Link, Google Scholar