Computing Proper Equilibria of Zero-Sum Games
暂无分享,去创建一个
[1] M. Dresher. The Mathematics of Games of Strategy: Theory and Applications , 1981 .
[2] E. Damme. Refinements of the Nash Equilibrium Concept , 1983 .
[3] M. Balinski. An algorithm for finding all vertices of convex polyhedral sets , 1959 .
[4] Ulf Lorenz,et al. Beyond Optimal Play in Two-Person-Zerosum Games , 2004, ESA.
[5] M. G. Fiestras-Janeiro,et al. The Concept of Proper Solution in Linear Programming , 2000 .
[6] Andrew McLennan,et al. Gambit: Software Tools for Game Theory , 2006 .
[7] E. Damme. A relation between perfect equilibria in extensive form games and proper equilibria in normal form games , 1984 .
[8] Avi Pfeffer,et al. Representations and Solutions for Game-Theoretic Problems , 1997, Artif. Intell..
[9] T. Sandholm,et al. Finding equilibria in large sequential games of incomplete information ∗ , 2005 .
[10] Susanne Albers,et al. Algorithms – ESA 2004 , 2004, Lecture Notes in Computer Science.
[11] John Hillas. ON THE RELATION BETWEEN PERFECT EQUILIBRIA IN EXTENSIVE FORM GAMES AND PROPER EQUILIBRIA IN NORMAL FORM GAMES , 1996 .
[12] H. F. Bohnenblust,et al. Solutions of Discrete, Two-Person Games , 1949 .
[13] Roger B. Myerson,et al. Acceptable and predominant correlated equilibria , 1986 .
[14] Peter Bro Miltersen,et al. Computing sequential equilibria for two-player games , 2006, SODA '06.
[15] Jonathan Schaeffer,et al. Approximating Game-Theoretic Optimal Strategies for Full-scale Poker , 2003, IJCAI.
[16] Bernhard von Stengel,et al. Fast algorithms for finding randomized strategies in game trees , 1994, STOC '94.
[17] D. Gale,et al. 4. SOLUTIONS OF FINITE TWO-PERSON GAMES , 1951 .
[18] E. Vandamme. Stability and perfection of nash equilibria , 1987 .