Potential game
Wikipedia open wikipedia design.In game theory, a game is said to be a potential game if the incentive of all players to change their strategy can be expressed using a single global function called the potential function. The concept originated in a 1996 paper by Dov Monderer and Lloyd Shapley.^{[1]}
The properties of several types of potential games have since been studied. Games can be either ordinal or cardinal potential games. In cardinal games, the difference in individual payoffs for each player from individually changing one's strategy, other things equal, has to have the same value as the difference in values for the potential function. In ordinal games, only the signs of the differences have to be the same.
The potential function is a useful tool to analyze equilibrium properties of games, since the incentives of all players are mapped into one function, and the set of pure Nash equilibria can be found by locating the local optima of the potential function. Convergence and finitetime convergence of an iterated game towards a Nash equilibrium can also be understood by studying the potential function.
Definition[edit]
We will define some notation required for the definition. Let be the number of players, the set of action profiles over the action sets of each player and be the payoff function.
A game is:
 an exact potential game if there is a function such that ,
 That is: when player switches from action to action , the change in the potential equals the change in the utility of that player.
 a weighted potential game if there is a function and a vector such that ,
 an ordinal potential game if there is a function such that ,
 a generalized ordinal potential game if there is a function such that ,
 a bestresponse potential game if there is a function such that ,
where is the best action for player given .
A simple example[edit]
In a 2player, 2strategy game with externalities, individual players' payoffs are given by the function u_{i}(s_{i}, s_{j}) = b_{i} s_{i} + w s_{i} s_{j}, where s_{i} is players i's strategy, s_{j} is the opponent's strategy, and w is a positive externality from choosing the same strategy. The strategy choices are +1 and −1, as seen in the payoff matrix in Figure 1.
This game has a potential function P(s_{1}, s_{2}) = b_{1} s_{1} + b_{2} s_{2} + w s_{1} s_{2}.
If player 1 moves from −1 to +1, the payoff difference is Δu_{1} = u_{1}(+1, s_{2}) – u_{1}(–1, s_{2}) = 2 b_{1} + 2 w s_{2}.
The change in potential is ΔP = P(+1, s_{2}) – P(–1, s_{2}) = (b_{1} + b_{2} s_{2} + w s_{2}) – (–b_{1} + b_{2} s_{2} – w s_{2}) = 2 b_{1} + 2 w s_{2} = Δu_{1}.
The solution for player 2 is equivalent. Using numerical values b_{1} = 2, b_{2} = −1, w = 3, this example transforms into a simple battle of the sexes, as shown in Figure 2. The game has two pure Nash equilibria, (+1, +1) and (−1, −1). These are also the local maxima of the potential function (Figure 3). The only stochastically stable equilibrium is (+1, +1), the global maximum of the potential function.



A 2player, 2strategy game cannot be a potential game unless
See also[edit]
References[edit]
 ^ Monderer, Dov; Shapley, Lloyd (1996). "Potential Games". Games and Economic Behavior. 14: 124–143. doi:10.1006/game.1996.0044.
External links[edit]
 Lecture notes of Yishay Mansour about Potential and congestion games
 Section 19 in: Vazirani, Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0521872820.
 Non technical exposition by Huw Dixon of the inevitability of collusion Chapter 8, Donut world and the duopoly archipelago,Surfing Economics.
This page is based on a Wikipedia article written by contributors (read/edit).
Text is available under the CC BYSA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.