A Polynomial-Time Algorithm for Action Graph Games
暂无分享,去创建一个
[1] R. Rosenthal. A class of games possessing pure-strategy Nash equilibria , 1973 .
[2] Edward Fredkin,et al. Trie memory , 1960, Commun. ACM.
[3] Christos H. Papadimitriou,et al. Computing correlated equilibria in multi-player games , 2005, STOC '05.
[4] Nevin Lianwen Zhang,et al. Exploiting Causal Independence in Bayesian Network Inference , 1996, J. Artif. Intell. Res..
[5] Robert Wilson,et al. Computing Nash equilibria by iterated polymatrix approximation , 2004 .
[6] A. Talman,et al. Simplicial variable dimension algorithms for solving the nonlinear complementarity problem on a product of unit simplices using a general labelling , 1987 .
[7] Daphne Koller,et al. Multi-Agent Influence Diagrams for Representing and Solving Games , 2001, IJCAI.
[8] Yoav Shoham,et al. Simple search methods for finding a Nash equilibrium , 2004, Games Econ. Behav..
[9] Moshe Tennenholtz,et al. Local-Effect Games , 2003, IJCAI.
[10] Michael L. Littman,et al. Graphical Models for Game Theory , 2001, UAI.
[11] Kevin Leyton-Brown,et al. Computing Nash Equilibria of Action-Graph Games , 2004, UAI.
[12] Robert Wilson,et al. A global Newton method to compute Nash equilibria , 2003, J. Econ. Theory.
[13] Pierfrancesco La Mura. Game Networks , 2000, UAI.