N−Body Games

This paper introduces n-body games, a new compact game-theoretic representation which permits a wide variety of game-theoretic quantities to be efficiently computed both approximately and exa ctly. This representation is useful for games which consist of choosing actions from a metric space (e.g., points in space) and in which payoffs are a function of the distances between players’ action choices. 1

[1]  H. Hotelling.  Stability in Competition , 1929 .

[2]  Andrew W. Moore,et al.  Rapid Evaluation of Multiple Density Models , 2003, AISTATS.

[3]  Michael P. Wellman,et al.  Computing approximate bayes-nash equilibria in tree-games of incomplete information , 2004, EC '04.

[4]  Daphne Koller,et al.  Multi-Agent Influence Diagrams for Representing and Solving Games , 2001, IJCAI.

[5]  Tim Roughgarden,et al.  Bounding the inefficiency of equilibria in nonatomic congestion games , 2004, Games Econ. Behav..

[6]  Moshe Tennenholtz,et al.  k-Implementation , 2003, EC '03.

[7]  Larry S. Davis,et al.  Improved fast gauss transform and efficient kernel density estimation , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[8]  Michael L. Littman,et al.  Graphical Models for Game Theory , 2001, UAI.

[9]  Kevin Leyton-Brown,et al.  Computing Nash Equilibria of Action-Graph Games , 2004, UAI.

[10]  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 .

[11]  Andrew W. Moore,et al.  'N-Body' Problems in Statistical Learning , 2000, NIPS.

[12]  Andrew W. Moore,et al.  Nonparametric Density Estimation: Toward Computational Tractability , 2003, SDM.

[13]  Leslie Greengard,et al.  A fast algorithm for particle simulations , 1987 .

[14]  Nando de Freitas,et al.  Empirical Testing of Fast Kernel Density Estimation Algorithms , 2005 .

[15]  L. Shapley,et al.  Potential Games , 1994 .

[16]  Moshe Tennenholtz,et al.  Congestion games with failures , 2005, EC '05.

[17]  Aranyak Mehta,et al.  Fairness and optimality in congestion games , 2005, EC '05.

[18]  Tim Roughgarden,et al.  Computing equilibria in multi-player games , 2005, SODA '05.

[19]  Moshe Tennenholtz,et al.  Local-Effect Games , 2003, IJCAI.

[20]  Gunilla Borgefors,et al.  Distance transformations in digital images , 1986, Comput. Vis. Graph. Image Process..

[21]  L. Greengard,et al.  A new version of the fast Gauss transform. , 1998 .

[22]  Yoav Shoham,et al.  Simple search methods for finding a Nash equilibrium , 2004, Games Econ. Behav..

[23]  Andrew W. Moore,et al.  The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data , 2000, UAI.

[24]  George Roussos,et al.  A New Error Estimate of the Fast Gauss Transform , 2002, SIAM J. Sci. Comput..

[25]  Nevin Lianwen Zhang,et al.  Exploiting Causal Independence in Bayesian Network Inference , 1996, J. Artif. Intell. Res..

[26]  Robert Wilson,et al.  A global Newton method to compute Nash equilibria , 2003, J. Econ. Theory.

[27]  Nando de Freitas,et al.  Fast maximum a-posteriori inference on Monte Carlo state spaces , 2005, AISTATS.

[28]  Christos H. Papadimitriou,et al.  Computing correlated equilibria in multi-player games , 2005, STOC '05.

[29]  Paul W. Goldberg,et al.  Reducibility among equilibrium problems , 2006, STOC '06.

[30]  R. Rosenthal.  A class of games possessing pure-strategy Nash equilibria , 1973 .

[31]  Jon M. Kleinberg,et al.  Fast Algorithms for Large-State-Space HMMs with Applications to Web Usage Analysis , 2003, NIPS.