Nash Propagation for Loopy Graphical Games

  title={Nash Propagation for Loopy Graphical Games},
  author={Luis E. Ortiz and Michael Kearns},
We introduce NashProp, an iterative and local message-passing algorithm for computing Nash equilibria in multi-player games represented by arbitrary undirected graphs. We provide a formal analysis and experimental evidence demonstrating that NashProp performs well on large graphical games with many loops, often converging in just a dozen iterations on graphs with hundreds of nodes. NashProp generalizes the tree algorithm of (Kearns et al. 2001), and can be viewed as similar in spirit to belief… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 82 citations. REVIEW CITATIONS
51 Citations
6 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 51 extracted citations

83 Citations

Citations per Year
Semantic Scholar estimates that this publication has 83 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-6 of 6 references

Local computations with probabilities on graphical structures and their application to expert systems

  • S. Lauritzen, D. Spiegelhalter
  • J. Royal Stat. Soc. B,
  • 1988
1 Excerpt

Non-cooperative games

  • J. F. Nash
  • Annals of Mathematics,
  • 1951
1 Excerpt

Similar Papers

Loading similar papers…