Semidefinite programming for min-max problems and games

Mathematical Programming

Volumn 131, Issue 1-2, 2012, Pages 305-332

  Laraki, R ^a,b   Lasserre, J B ^c  

^a ECOLE POLYTECHNIQUE   (France)

^b CNRS   (France)

^c LAAS CNRS   (France)

Author keywords

Min max optimization problems; N player games; Nash equlibria; Semidefinite programming

Indexed keywords

FINITE CONVERGENCE; INPUT SIZE; MATH PROGRAMS; MIN-MAX OPTIMIZATION; MIN-MAX STRATEGY; MINMAX PROBLEM; N-PLAYER GAMES; NASH EQUILIBRIA; NASH EQULIBRIA; OPTIMAL VALUES; POLYNOMIAL OPTIMIZATION; RANDOMIZED STRATEGY; SEMI-ALGEBRAIC SET; SEMI-ALGEBRAIC SETS; SEMI-DEFINITE PROGRAMMING; SEMIDEFINITE RELAXATION; STATIC AND DYNAMIC; SUPREMUM; UNIFIED APPROACH;

ALGEBRA; POLYNOMIAL APPROXIMATION;

MATHEMATICAL PROGRAMMING;

EID: 84857636138     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-010-0353-y     Document Type: Article

References (50)

1. Ash R.: Real Analysis and Probability. Academic Press, San Diego (1972)
2. Aumann R.J.; Shapley L.S.: Long-term competition-a game theoretic analysis. In: Megiddo, N. (eds) Essays on Game Theory, pp. 1-15. Springer-Verlag, New-York (1994)
3. Borgs, C.; Chayes, J.; Immorlica, N.; Kalai, A.T.; Mirrokni, V.; Papadimitriou, C.: The mith of the Folk theorem. Games Econ. Behav. (in press) (2009)
4. Chen, X.; Deng, X.: Settling the complexity of two-player Nash equilibrium. J. ACM 56 (2009)
5. Dantzig G.B.: Linear Programming and Extenstions. Princeton University Press, Princeton (1963)
6. C. Daskalakis P.W. Goldberg C.H. Papadimitriou 2009 The complexity of computing a Nash equilibrium SIAM J. Comput. 39 195 259 2506524 1185.91019 10.1137/070699652
7. R.S. Datta 2010 Finding all Nash equilibria of a finite game using polynomial algebra Econ. Theory 42 55 96 1185.91025 10.1007/s00199-009-0447-z
8. Dresher, M.; Karlin, S.; Shapley, L.S.: Polynomial games. In Contributions to the Theory of Games, Annals of Mathematics Studies, vol. 24, pp. 161-180. Princeton University Press, Princeton (1950)
9. A.M. Fink 1964 Equilibrium in a stochastic n-person game J. Sci. Hiroshima Univ. 28 89 93 178975 0126.36506
10. I. Glicksberg 1952 A further generalization of the kakutani fixed point theorem with applications to Nash equilibrium points Proc. Amer. Math. Soc. 3 170 174 46638 0046.12103
11. S. Govindan R. Wilson 2003 A global newton method to compute Nash equilibria J. Econ. Theory 110 65 86 1984254 1042.91001 (Pubitemid 36802525)
12. G. Gürkan J.S. Pang 2009 Approximations of Nash equilibria Math. Program. B 117 223 253 1216.91003 10.1007/s10107-007-0156-y
13. D. Henrion J.B. Lasserre 2003 GloptiPoly : global optimization over polynomials with matlab and SeDuMi ACM Trans. Math. Soft. 29 165 194 2000881 1070.65549 10.1145/779359.779363 (Pubitemid 40001449)
14. D. Henrion J.B. Lasserre J. Lofberg 2009 GloptiPoly 3: moments, optimization and semidefinite programming, optim Methods Softw. 24 761 779 2554910 1178.90277 10.1080/10556780802699201
15. P.J.-J. Herings R. Peeters 2005 A globally convergent algorithm to compute all Nash equilibria for n-person games Ann. Oper. Res. 137 349 368 2166447 1138.91310 10.1007/s10479-005-2265-4 (Pubitemid 41174533)
16. P.J.-J. Herings R. Peeters 2010 Homotopy methods to compute equilibria in game theory Econ. Theory 42 119 156 2551731 1185.91028 10.1007/s00199-009-0441- 5
17. P.J.-J. Herings A.H. van den Elzen 2002 Computation of the Nash equilibrium selected by the tracing procedure in n-person games Games Econ. Behav. 38 89 117 1013.91004 10.1006/game.2001.0856
18. D. Jibetean E. De Klerk 2006 Global optimization of rational functions: an SDP approach Math. Prog. 106 103 109 2195619 10.1007/s10107-005-0589-0 (Pubitemid 41813171)
19. L. Khachiyan 1979 A polynomial algorithm in linear programming Dokl. Akad. Nauk SSSR 224, 1093-1096. English translation in Soviet Math. Dokl 20 191 194 0409.90079
20. E. Kohlberg 1974 Repeated games with absorbing states Ann. Stat. 2 724 738 371425 0297.90114 10.1214/aos/1176342760
21. M.M. Kostreva L.A. Kinard 1991 A differential homotopy approach for solving polynomial optimization problems and noncooperative games Comput. Math. Appl. 21 135 143 1096141 0721.90071 10.1016/0898-1221(91)90168-4
22. R. Laraki 2010 Explicit formulas for repeated games with absorbing states Int. J. Game Theory Spec. Issue Honor Michael Maschler 39 53 69 2596515 1211.91061
23. J.B. Lasserre 2001 Global optimization with polynomials and the problem of moments SIAM J. Optim. 11 796 817 1814045 1010.90061 10.1137/ S1052623400366802
24. J.B. Lasserre 2006 Convergent SDP-relaxations in polynomial optimization with sparsity SIAM J. Optim. 17 822 843 2257211 1119.90036 10.1137/05064504X (Pubitemid 47265174)
25. J.B. Lasserre 2008 A semidefinite programming approach to the generalized problem of moments Math. Program. B 112 65 92 2327002 1145.90049 10.1007/s10107-006-0085-1 (Pubitemid 47167325)
26. J.B. Lasserre M. Laurent P. Rostalski 2008 Semidefinite characterization and computation of zero-dimensional real radical ideals Found. Comput. Math. 8 607 647 2443091 1176.14010 10.1007/s10208-007-9004-y
27. J.B. Lasserre 2009 Moments and sums of squares for polynomial optimization and related problems J. Global Optim. 45 39 61 2533741 1177.90324 10.1007/s10898-008-9394-7
28. C.E. Lemke J.T. Howson 1964 Equilibrium points of bimatrix games J. SIAM 12 413 423 173556 0128.14804
29. Lipton, R.; Markakis, E.: Nash equilibria via polynomial equations. In: Proceedings of the Latin American Symposium on Theoretical Informatics, Buenos Aires, Argentina, Lecture Notes in Computer Sciences, pp. 413-422. Springer Verlag, Berlin (2004)
30. Lipton, R.J.; Markakis, E.; Mehta, A.: Playing large games using simple strategies. In: Proceedings of the 8th ACM Conference on Electronic Commerce, pp. 36-41 (2003)
31. L.H. Loomis 1946 On a theorem of von neumann Proc. Nat. Acad. Sci. 32 213 215 17258 0060.03606 10.1073/pnas.32.8.213
32. J.F. Nash 1950 Equilibrium points in n-person games Proc. Nat. Acad. Sci. 36 48 49 31701 0036.01104 10.1073/pnas.36.1.48
33. Nisan, N.; Roughgarden, T.; Tardos, E.; Vazirani, V.V. (eds): Algorithmic Game Theory. Cambridge University Press, Cambridge (2008) (first published 2007)
34. C.H. Papadimitriou 1994 On the complexity of the parity argument and other inefficient proofs of existence J. Compt. Syst. Sci. 48 3 498 532 1279412 0806.68048 10.1016/S0022-0000(05)80063-7 (Pubitemid 124013301)
35. Papadimitriou C.H.: On the complexity of finding Nash equilibria. In: Nisan, N.; Roughgarden, T.; Tardos, E.; Vazirani V.V.; (eds) Algorithmic Game Theory, chap. 2, Cambridge University Press, Cambridge (2008) (first published 2007)
36. Parrilo, P.A.: Polynomial games and sum of squares optimization. In: Proceedings of the 45th IEEE Conference on Decision and Control, pp. 2855-2860 (2006) (Pubitemid 351284327)
37. M. Putinar 1993 Positive polynomials on compact semi-algebraic sets Ind. Univ. Math. J. 42 969 984 1254128 0796.12002 10.1512/iumj.1993.42.42045
38. J. Rosenmüller 1971 On a generalization of the lemke-howson algorithm to non cooperative n-person games SIAM J. Appl. Math. 21 73 79 287921 0222.90053 10.1137/0121010
39. T. Roughgarden 2010 Computing equilibria: a computational complexity perspective Econ. Theory 42 193 236 2551734 1192.91035 10.1007/s00199-009-0448-y
40. R. Savani B. von Stengel 2006 Hard-to-Solve bimatrix games Econometrica 74 397 429 2207396 1145.91301 10.1111/j.1468-0262.2006.00667.x (Pubitemid 43417673)
41. M. Schweighofer 2004 On the complexity of Schmüdgen's positivstellensatz J. Complex. 20 529 543 2068157 1161.68480 10.1016/j.jco.2004.01.005 (Pubitemid 38956021)
42. M. Schweighofer 2005 Optimization of polynomials on compact semialgebraic sets SIAM J. Optim. 15 805 825 2142861 1114.90098 10.1137/S1052623403431779 (Pubitemid 41156916)
43. Shah, P.; Parrilo, P.A.: Polynomial stochastic games via sum of squares optimization. In: Proceedings of the 46th IEEE Conference on Decision and Control, pp. 745-750 (2007) (Pubitemid 351277242)
44. L.S. Shapley 1953 Stochastic games Proc. Nat. Acad. Sci. 39 1095 1100 61807 0051.35805 10.1073/pnas.39.10.1095
45. Stein, N.; Parrilo, P.A.; Ozdaglar, A.: Correlated Equilibria in Continuous Games: Characterization and Computation. arXiv:0812.4279v1 (2008)
46. Sturmfels B.: Solving Systems of Polynomial Equations. American Mathemathical Society, Providence Rhode, Island (2002)
47. A.H. van den Elzen A.J.J. Talman 1991 A procedure for finding Nash equilibria in bi-matrix games ZOR Methods Models Oper. Res. 35 27 43 0729.90093 10.1007/BF01415958
48. V. Verschelde 1999 PHCpack: a general-purpose solver for polynomial systems by homotopy continuation ACM Trans. Math. Softw. 25 251 276 0961.65047 10.1145/317275.317286
49. H. Waki S. Kim M. Kojima M. Muramatsu 2006 Sums of squares and semidefinite programming relaxations for polynomial optimization problems with structured sparsity SIAM J. Optim. 17 218 242 2219151 1109.65058 10.1137/050623802 (Pubitemid 46279501)
50. R. Wilson 1971 Computing equilibria of n-person games SIAM J. Appl. Math. 21 80 87 371424 10.1137/0121011