Finding Equilibria in Games of No Chance
暂无分享,去创建一个
[1] Xiaotie Deng,et al. Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[2] H. W. Kuhn,et al. 11. Extensive Games and the Problem of Information , 1953 .
[3] Bernhard von Stengel,et al. Extensive-Form Correlated Equilibrium: Definition and Computational Complexity , 2008, Math. Oper. Res..
[4] Jean R. S. Blair,et al. PERFECT RECALL AND PRUNING IN GAMES WITH IMPERFECT INFORMATION 1 , 1996, Comput. Intell..
[5] D. Koller,et al. The complexity of two-person zero-sum games in extensive form , 1992 .
[6] Bernhard von Stengel,et al. Fast algorithms for finding randomized strategies in game trees , 1994, STOC '94.