Graph-Based Bounds on k-Optimal Joint-Action Sets for Multiple Agents
暂无分享,去创建一个
[1] Makoto Yokoo,et al. Adopt: asynchronous distributed constraint optimization with quality guarantees , 2005, Artif. Intell..
[2] A. McLennan. The Expected Number of Nash Equilibria of a Normal Form Game , 2005 .
[3] Vincent Conitzer,et al. Complexity Results about Nash Equilibria , 2002, IJCAI.
[4] Rich Caruana,et al. Estimating the Number of Local Minima in Big, Nasty Search Spaces , 1999 .
[5] Soraya B. Rana,et al. Representation Issues in Neighborhood Search and Evolutionary Algorithms , 1998 .
[6] Daphne Koller,et al. A Continuation Method for Nash Equilibria in Structured Games , 2003, IJCAI.
[7] Noga Alon,et al. Approximating the independence number via theϑ-function , 1998, Math. Program..
[8] H. Keiding. On the Maximal Number of Nash Equilibria in ann × nBimatrix Game , 1997 .
[9] Michael L. Littman,et al. Graphical Models for Game Theory , 2001, UAI.
[10] Kim Jong Tae,et al. New efficient clique partitioning algorithms for register-transfer synthesis of data paths , 2002 .
[11] John Levine,et al. Generation of Multiple Qualitatively Different Plan Options , 1998, AIPS.
[12] Eugene C. Freuder. Synthesizing constraint expressions , 1978, CACM.
[13] Rina Dechter,et al. Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..
[14] A. McLennan,et al. Generic 4 x 4 Two Person Games Have at Most 15 Nash Equilibria , 1999 .
[15] Chaoping Xing,et al. Coding Theory: A First Course , 2004 .