Computing Pure Nash Equilibria via Markov Random Fields

Details Computing Pure Nash Equilibria via Markov Random Fields Computing Pure Nash Equilibria via Markov Random Fields

2005-10-13

arxiv.org/abs/cs/0510031v1

Computer Science

Computer Science and Game Theory

Scientific paper

In this paper we present a novel generic mapping between Graphical Games and Markov Random Fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Thus, the problem of deciding whether a graphical game has a pure Nash equilibrium, a well-known intractable problem, can be attacked by well-established algorithms such as Belief Propagation, Junction Trees, Markov Chain Monte Carlo and Simulated Annealing. Large classes of graphical games become thus tractable, including all classes already known, but also new classes such as the games with O(log n) treewidth.

Affiliated with

Also associated with

No associations

Rating

Computing Pure Nash Equilibria via Markov Random Fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing Pure Nash Equilibria via Markov Random Fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Pure Nash Equilibria via Markov Random Fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-469658