Potential Games

By Dov Monderer, Lloyd S. Shapley. 1994

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Game & Decision Theory

Citations in the corpus

Negative Momentum for Improved Game Dynamics (2018, background): “These notions of adversarial and cooperative games can be related to the notions of potential games (Monderer and Shapley, 1996) and Hamiltonian games recently introduced by Balduzzi et al. (2018): a game is a potential game (resp.”
Discovering Diverse Multi-Agent Strategic Behavior via Reward Randomization (2021, methodology): “…decentralized PG in this paper, RR can be combined with any other multi-agent learning algorithms for games, such as ﬁctitious play (Robinson, 1951; Monderer & Shapley, 1996; Heinrich & Silver, 2016; Kamra et al., 2019; Han & Hu, 2019), double-oracle (McMahan et al., 2003; Lanctot et al., 2017;…”
The Mechanics of n-Player Differentiable Games (2018, background): “The ﬁrst case, known as potential games (Monderer & Shapley, 1996), have been intensively studied because they are exactly the games where gradient descent does converge.”
Learning sequences of actions in collectives of autonomous agents (2002, background): “As a trivial example, any \team game" in which all the payo functions equal G is factored [4, 13].”
Computation Offloading and Resource Allocation For Cloud Assisted Mobile Edge Computing in Vehicular Networks (2019, background): “In this section, we take the advantage of the FIP of computation offloading strategy game and design an effective algorithm identified as DCORA algorithm for CCOROA scheme.”
Negative Externalities and Evolutionary Implementation (2005, methodology): “Our analysis relies upon the notion of a potential game (Monderer and Shapley (1996), Sandholm (2001)).”
Learning and Equilibrium (2009, background): “…between smooth best responses and deterministic payoff perturbations to construct Lyapunov function for SFP in zero-sum games and potential games (Monderer & Shapley (1996)) and hence prove (under mild additional conditions) that SFP converges to a steady state of the continuous time system.”
Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation (2010, background): “This paper focuses primarily on the class of potential games [11].”
Concentration of Competing Retail Stores (2005, background): “This is simply a coordination problem.19 Now consider the situation that 18See also Monderer and Shapley (1996) and Konishi, Le Breton, and Weber (1998).”
Potential Games with Continuous Player Sets (2001, background): “The condition we use is actually somewhat weaker than this – see Section 4.”
Decentralized Anti-coordination Through Multi-agent Learning (2013, background): “All the games discussed above, including the channel allocation game, form part of the family of potential games introduced by Monderer and Shapley (1996).”
Decentralized charging control for large populations of plug-in electric vehicles (2010, background): “This charging game falls within the class of potential games identified by Monderer and Shapley [8].”
Efficiency loss in a network resource allocation game: the case of elastic supply (2004, background): “Theorem 2 is also closely related to potential games [21], where best responses of players are characterized by changes in a global potential function.”
Convex Optimization, Game Theory, and Variational Inequality Theory (2010, background): “For example, this is the case of the so-called potential games [29] and supermodular games [30].”
Optimal Transport for Applied Mathematicians: Calculus of Variations, PDEs, and Modeling (2015, background): “a game where equilibria can be found by minimizing a global energy, see [238]).”