Computer Science – Computer Science and Game Theory
Scientific paper
2011-06-17
Computer Science
Computer Science and Game Theory
Scientific paper
We introduce several methods of decomposition for two player normal form games. Viewing the set of all games as a vector space, we exhibit explicit orthonormal bases for the subspaces of potential games, zero-sum games, and their orthogonal complements which we call anti-potential games and anti-zero-sum games, respectively. Perhaps surprisingly, every anti-potential game comes either from the Rock-Paper-Scissors type games (in the case of symmetric games) or from the Matching Pennies type games (in the case of asymmetric games). Using these decompositions, we prove old (and some new) cycle criteria for potential and zero-sum games (as orthogonality relations between subspaces). We illustrate the usefulness of our decomposition by (a) analyzing the generalized Rock-Paper-Scissors game, (b) completely characterizing the set of all null-stable games, (c) providing a large class of strict stable games, (d) relating the game decomposition to the decomposition of vector fields for the replicator equations, (e) constructing Lyapunov functions for some replicator dynamics, and (f) constructing Zeeman games -games with an interior asymptotically stable Nash equilibrium and a pure strategy ESS.
Hwang Sung-Ha
Rey-Bellet Luc
No associations
LandOfFree
Decompositions of two player games: potential, zero-sum, and stable games 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 Decompositions of two player games: potential, zero-sum, and stable games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decompositions of two player games: potential, zero-sum, and stable games will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-696629