Computing the Equilibria of Bimatrix Games using Dominance Heuristics

Details Computing the Equilibria of Bimatrix Games using Dominance Heuristics Computing the Equilibria of Bimatrix Games using Dominance Heuristics

2006-12-06

arxiv.org/abs/cs/0612039v1

Computer Science

Computer Science and Game Theory

Scientific paper

We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structures of the graph (in particular elementary cycles) and the set of the Nash equilibria of the game. We show that finding the set of elementary cycles of the graph permits the computation of the set of equilibria. For games whose graphs have a sparse adjacency matrix, this serves as a good heuristic for computing the set of equilibria. The heuristic also allows the discarding of sections of the support space that do not yield any equilibrium, thus serving as a useful pre-processing step for algorithms that compute the equilibria through support enumeration.

Affiliated with

Also associated with

No associations

Rating

Computing the Equilibria of Bimatrix Games using Dominance Heuristics 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 the Equilibria of Bimatrix Games using Dominance Heuristics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing the Equilibria of Bimatrix Games using Dominance Heuristics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-452159