论文信息 - The complexity of two-person zero-sum games in extensive form - 字舞流文

The complexity of two-person zero-sum games in extensive form

D. Koller | N. Megiddo

[1] Xiaotie Deng,et al. On the Complexity of Cooperative Solution Concepts , 1994, Math. Oper. Res..

[2] Eitan Zemel,et al. Nash and correlated equilibria: Some complexity considerations , 1989 .

[3] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1988, Algorithms and Combinatorics.

[4] Akira Okada. Complete inflation and perfect recall in extensive games , 1987 .

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] Robert Wilson. Computing Equilibria of Two-Person Games from the Extensive Form , 1972 .

[7] William F. Lucas,et al. An Overview of the Mathematical Theory of Games , 1972 .

[8] Steven Vajda,et al. Introduction to the Theory of Games , 1953 .

[9] N. Dalkey. EQUIVALENCE OF INFORMATION PATTERNS AND ESSENTIALLY DETERMINATE GAMES , 1952 .

[10] E. Rowland. Theory of Games and Economic Behavior , 1946, Nature.

[11] J. Neumann,et al. Theory of games and economic behavior , 1945, 100 Years of Math Milestones.