Computing approximate bayes-nash equilibria in tree-games of incomplete information
暂无分享,去创建一个
[1] J. Nash. NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.
[2] J. Harsanyi. Games with Incomplete Information Played by “Bayesian” Players Part II. Bayesian Equilibrium Points , 1968 .
[3] J. Harsanyi. Games with Incomplete Information Played by 'Bayesian' Players, Part III. The Basic Probability Distribution of the Game , 1968 .
[4] Robert J. Weber,et al. Distributional Strategies for Games with Incomplete Information , 1985, Math. Oper. Res..
[5] Drew Fudenberg,et al. Game theory (3. pr.) , 1991 .
[6] Paul R. Milgrom,et al. Monotone Comparative Statics , 1994 .
[7] Susan Athey,et al. Single Crossing Properties and the Existence of Pure Strategy Equilibria in Games of Incomplete Information , 1997 .
[8] D. M. Topkis. Supermodularity and Complementarity , 1998 .
[9] Michael L. Littman,et al. Graphical Models for Game Theory , 2001, UAI.
[10] Michael L. Littman,et al. An Efficient, Exact Algorithm for Solving Tree-Structured Graphical Games , 2001, NIPS.
[11] Luis E. Ortiz,et al. Nash Propagation for Loopy Graphical Games , 2002, NIPS.
[12] Daphne Koller,et al. Multi-agent algorithms for solving graphical games , 2002, AAAI/IAAI.
[13] Moshe Tennenholtz,et al. Local-Effect Games , 2003, IJCAI.
[14] John Langford,et al. Correlated equilibria in graphical games , 2003, EC '03.
[15] Vincent Conitzer,et al. Complexity Results about Nash Equilibria , 2002, IJCAI.