Equilibria, fixed points and complexity classes

Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

Volumn , Issue , 2008, Pages 19-38

  Yannakakis, Mihalis ^a  

^a Columbia University ^*  (United States)

Author keywords

Computational complexity; Equilibria; Fixed points; Game theory

Indexed keywords

COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY; CONTEXT FREE GRAMMARS; CONTEXT FREE LANGUAGES; GAME THEORY; MARKOV PROCESSES; POLYNOMIAL APPROXIMATION; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

EQUILIBRIA; FIXED POINTS; MARKET EQUILIBRIA; OPTIMAL STRATEGIES; PURE NASH EQUILIBRIUM; RECURSIVE MARKOV CHAINS; STABLE CONFIGURATION; STOCHASTIC CONTEXT FREE GRAMMAR;

COMPUTER GAMES;

EID: 45849089995     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (67)

1. H. Ackermann, H. Roglin, B. Vocking. On the impact of combinatorial structure on congestion games. Proc. 47th IEEE FOCS, 2006.
2. E. Allender, P. Bürgisser, J. Kjeldgaard-Pedersen, and P. B. Miltersen. On the complexity of numerical analysis. Proc. 21st IEEE Comp. Compl. Conf., 2006.
3. K.J. Arrow, G. Debreu. Existence of an equilibrium for a competitive economy. Econometrica, 22, pp. 265-290, 1954.
4. R. M. Anderson. "Almost" implies "Near". Trans. Am. Math. Soc., 296, pp. 229-237, 1986.
5. R.J. Aumann, S. Hart (eds.). Handbook of Game Theory, vol. 3, North-Holland, 2002.
6. L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and Real Computation. Springer-Verlag, 1998.
7. J. Canny. Some algebraic and geometric computations in PSPACE. Proc. ACM STOC, pp. 460-467, 1988.
8. X. Chen and X. Deng. Settling the complexity of two-player Nash equilibrium. Proc. 47th IEEE FOCS, pp. 261-272, 2006.
9. X. Chen, X. Deng. On the complexity of 2d discrete fixed point problem. Proc. ICALP, pp. 489-599, 2006.
10. X. Chen, X. Deng. On algorithms for discrete and approximate Brouwer fixed points. Proc. ACM STOC, pp. 323-330, 2005.
11. X. Chen, X. Deng, and S. H. Teng. Computing Nash equilibria: approximation and smoothed complexity. Proc. 47th IEEE FOCS, pp. 603-612, 2006.
12. B. Codenotti, A. Saberi, K. Varadarajan, Y. Ye. Leontieff economies encode nonzero sum two-player games. Proc. SIAM SODA, pp. 659-667, 2006.
13. A. Condon. The complexity of stochastic games. Inf. & Comp., 96(2):203-224, 1992.
14. C. Daskalakis, A. Fabrikant, and C. Papadimitriou. The game world is flat: The complexity of Nash equilibria in succinct games. Proc. ICALP, 2006.
15. C. Daskalakis, P. Goldberg, and C. Papadimitriou. The complexity of computing a Nash equilibrium. Proc. ACM STOC, pp. 71-78, 2006.
16. L. de Alfaro, T. A. Henzinger, O. Kupferman. Concurrent reachability games. Proc. IEEE FOCS, pp. 564-575, 1998.
17. G. Debreu. Excess demand functions. J. Math. Econ. 1, pp. 15-21, 1974.
18. A. Ehrenfeucht, J. Mycielski. Positional strategies for mean payoff games. Intl. J. Game Theory, 8, pp. 109-113, 1979.
19. P. van Emde Boas. Machine models and simulations. In Handbook of Theoretical Computer Science, vol. A, J. van Leeuwen ed., MIT Press, pp. 1-66, 1990.
20. E. A. Emerson, C. Jutla. Tree automata, μ-calculus and determinacy. Proc. IEEE FOCS, pp. 368-377, 1991.
21. J. Esparza, A. Kučera, and R. Mayr. Model checking probabilistic pushdown automata. Proc. of 19th IEEE LICS'04, 2004.
22. K. Etessami and M. Yannakakis. Recursive Markov chains, stochastic grammars, and monotone systems of non-linear equations. Proc. STACS, 2005. (Full expanded version available from http: //homepages.inf.ed.ac.uk/ kousha).
23. K. Etessami and M. Yannakakis. Recursive Markov decision processes and recursive stochastic games. Proc. 82nd ICALP, 2005.
24. K. Etessami and M. Yannakakis. Efficient qualitative analysis of classes of recursive Markov decision processes and simple stochastic games. Proc. 23rd STACS, Springer, 2006.
25. K. Etessami and M. Yannakakis. Recursive concurrent stochastic games. Proc. 33rd ICALP, 2006.
26. K. Etessami and M. Yannakakis. On the complexity of Nash equilibria and other fixed points. Proc. IEEE FOCS, 2007.
27. A. Fabrikant, C.H. Papadimitriou, K. Talwar. The complexity of pure Nash equilibria. Proc. ACM STOC, pp. 604-612, 2004.
28. M. R. Garey, R. L. Graham, and D. S. Johnson. Some NP-complete geometric problems. Proc. 8th ACM STOC, pp. 10-22, 1976.
29. J. Geanakoplos. Nash and Walras equilibrium via Brouwer. Economic Theory, 21:585-603, 2003.
30. I. Gilboa and E. Zemel. Nash and correlated equilibria: some complexity considerations. Games and Economic Behavior, 1:80-93, 1989.
31. P. Haccou, P. Jagers, V. A Vatutin. Branching Processes: Variation, Growth, and Extinction of Populations. Cambridge U. Press, 2005.
32. T. E. Harris. The Theory of Branching Processes. Springer-Verlag, 1963.
33. M. D. Hirsch, C. H. Papadimitriou, S. A. Vavasis. Exponential lower bounds for finding Brouwer fixed points. J. Complexity, 5, pp. 379-416, 1989.
34. J. J. Hopfield. Neural networks and physical systems with emergent collective computational abilities. Proc. Nat. Acad. Sci. 79, pp. 2554-2558, 1982.
35. D. S. Johnson. The NP-completeness column: Finding needles in haystacks. ACM Trans. Algorithms 3, 2007.
36. D. S. Johnson, C. H. Papadimitriou, M. Yannakakis. How easy is local search? J. Comp. Sys. Sci., 37, pp. 79-100, 1988.
37. B. Juba. On the hardness of simple stochastic games. Master's thesis, CMU, 2005.
38. M. Jurdzinski. Deciding the winner in parity games is in UP∩coUP. Inf. Proc. Let. 68, pp. 119-124, 1998.
39. M. Kearns. Graphical games. In [48], pp. 159-180, 2007.
40. K.-I. Ko. Computational complexity of fixpoints and intersection points. J. Complexity, 11, pp. 265-292, 1995.
41. A. N. Kolmogorov and B. A. Sevastyanov. The calculation of final probabilities for branching random processes. Doklady, 56:783-786, 1947. (Russian).
42. C. Lemke, J. Howson. Equilibrium points of bimatrix games. J. SIAM, pp. 413-423, 1964.
43. R.J. Lipton, E. Markakis, A. Mehta. Playing large games using simple strategies. Proc. ACM Conf. Elec. Comm., 36-41, 2003.
44. R.J. Lipton, E. Markakis. Nash equilibria via polynomial equations. Proc. LATIN, 2004.
45. C. Manning and H. Schütze. Foundations of Statistical Natural Language Processing. MIT Press, 1999.
46. J. Nash. Non-cooperative games. Annals of Mathematics, 54:289-295, 1951.
47. A. Neyman and S. Sorin, eds. Stochastic Games and Applications. Kluwer, 2003.
48. N. Nisan, T. Roughgarden, E. Tardos, V. Vazirani. Algorithmic Game Theory. Cambridge Univ. Press, 2007.
49. C. Papadimitriou. On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci., 48(3):498-532, 1994.
50. C. Papadimitriou. The complexity of finding Nash equilibria. In [48], pp. 29-52, 2007.
51. A. Puri. Theory of hybrid systems and discrete event systems. PhD Thesis, UC Berkeley, 1995.
52. J. Renegar. On the computational complexity and geometry of the first-order theory of the reals, parts I-III. J. Symb. Comp., 13(3):255-352, 1992.
53. M. Richter, K.-C. Wong. Non-computability of competitive equilibrium. Economic Theory, 14, pp. 1-27, 1999.
54. R. W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. Intl. J. Game Theory 2, pp. 65-67, 1973.
55. R. Savani, B. von Stengel. Hard to solve bimatrix games. Econometrica 74, pp. 397-429, 2006.
56. H. Scarf. The approximation of fixed points of a continuous mapping. SIAM J. Appl. Math., 15:1328-1343, 1967.
57. H. Scarf. The Computation of Economic Equilibria. Yale University Press, 1973.
58. A. Schaffer, M. Yannakakis. Simple Local Search Problems that are Hard to Solve. SIAM J. Comp., 20, pp. 56-87, 1991.
59. L.S. Shapley. Stochastic games. Proc. Nat. Acad. Sci., 39:1095-1100, 1953.
60. K. Sikorski. Optimal solution of nonlinear equations, Oxford Univ. Press, 2001.
61. B. von Stengel. Computing equilibria for two-person games. In [5], pp. 1723-1759, 2002.
62. P. Tiwari. A problem that is easier to solve on the unit-cost algebraic RAM. J. of Complexity, pp. 393-397, 1992.
63. H. Uzawa. Walras' existence theorem and Brouwer's fixpoint theorem. Econ. Stud. Quart., 13, pp. 59-62, 1962.
64. B. Vöcking. Congestion Games: Optimization in Competition. Proc. 2nd ACiD, pp. 9-20, 2006.
65. M. Yannakakis. The analysis of local search problems and their heuristics. Proc. STACS, pp. 298-311, 1990.
66. M. Yannakakis. Computational complexity of local search. In Local Search in Combinatorial Optimization, E.H.L. Aarts, J.K. Lenstra eds., John Wiley, 1997.
67. U. Zwick, M. S. Paterson. The complexity of mean payoff games on graphs. Theoretical Computer Science, 158, pp. 343-359, 1996.