Constraint satisfaction algorithms for graphical games
暂无分享,去创建一个
[1] Robert J. Weber,et al. Distributional Strategies for Games with Incomplete Information , 1985, Math. Oper. Res..
[2] Rina Dechter,et al. Tree-Clustering Schemes for Constraint-Processing , 1988, AAAI.
[3] Paul R. Milgrom,et al. Monotone Comparative Statics , 1994 .
[4] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[5] Susan Athey,et al. Single Crossing Properties and the Existence of Pure Strategy Equilibria in Games of Incomplete Information , 1997 .
[6] D. M. Topkis. Supermodularity and Complementarity , 1998 .
[7] Michael L. Littman,et al. Graphical Models for Game Theory , 2001, UAI.
[8] Luis E. Ortiz,et al. Nash Propagation for Loopy Graphical Games , 2002, NIPS.
[9] Daphne Koller,et al. Multi-agent algorithms for solving graphical games , 2002, AAAI/IAAI.
[10] Peter Stone,et al. A polynomial-time nash equilibrium algorithm for repeated games , 2003, EC '03.
[11] Michael P. Wellman,et al. Computing approximate bayes-nash equilibria in tree-games of incomplete information , 2004, EC '04.
[12] R. Weber,et al. DISTRIBUTIONAL STRATEGIES FOR GAMES WITH INCOMPLETE INFORMATION * t , 2007 .