On potential equations of finite games
From MaRDI portal
Abstract: In this paper, some new criteria for detecting whether a finite game is potential are proposed by solving potential equations. The verification equations with the minimal number for checking a potential game are obtained for the first time. Some connections between the potential equations and the existing characterizations of potential games are established. It is revealed that a finite game is potential if and only if its every bi-matrix sub-game is potential.
Recommendations
- On finite potential games
- Potential games and well-posedness properties
- Equilibria and approximate equilibria in infinite potential games
- Equilibrium payoffs of finite games
- A semi-potential for finite and infinite games in extensive form
- On the invariance of solutions of finite games
- Potential theory for mean payoff games
- Determinateness of strategic games with a potential
- A semi-potential for finite and infinite sequential games (extended abstract)
Cites work
- A class of games possessing pure-strategy Nash equilibria
- A Shapley value representation of potential games
- Algebraic formulation and strategy optimization for a class of evolutionary networked games via semi-tensor product method
- An improved algorithm for detecting potential games
- An introduction to semi-tensor product of matrices and its applications
- Analysis and control of Boolean networks. A semi-tensor product approach.
- Decompositions and potentials for normal form games
- Flows and decompositions of games: harmonic and potential games
- scientific article; zbMATH DE number 635657 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 3084669 (Why is no real title available?)
- Modeling, Analysis and Control of Networked Evolutionary Games
- Non-cooperative games
- On Decomposed Subspaces of Finite Games
- On finite potential games
- On the existence of pure Nash equilibria in weighted congestion games
- Potential games
- Selfish unsplittable flows
Cited in
(48)- On the invariance of solutions of finite games
- Algebraic formulation and Nash equilibrium of competitive diffusion games
- Global robust stability and stabilization of Boolean network with disturbances
- Incomplete-profile potential games
- Stochastic stability and stabilization of \(n\)-person random evolutionary Boolean games
- Optimal control of Boolean control networks with average cost: a policy iteration approach
- Complex systems with impulsive effects and logical dynamics: a brief overview
- State feedback for set stabilization of Markovian jump Boolean control networks
- A comprehensive survey on STP approach to finite games
- Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices
- Matrix approach to verification of finite multi-potential games
- On congestion games with player-specific costs and resource failures
- Games, graphs and Kirchhoff laws
- A semi-potential for finite and infinite games in extensive form
- Analyses and encryption implementation of a new chaotic system based on semitensor product
- Nash-stable coalition partition and potential functions in games with coalition structure
- Potential functions for finding stable coalition structures
- A congestion game framework for service chain composition in NFV with function benefit
- On basis and pure Nash equilibrium of finite pure harmonic games
- On three-player potential games
- Potential games and well-posedness properties
- On finite potential games
- Modelling and strategy consensus for a class of networked evolutionary games
- Recent advances in optimization and game theoretic control for networked systems
- Model matching of switched asynchronous sequential machines via matrix approach
- A matrix approach to the analysis and control of networked evolutionary games with bankruptcy mechanism
- An improved algorithm for detecting potential games
- Optimal control of random evolutionary Boolean games
- Algebraic verification of finite group-based potential games with vector payoffs
- Modeling, analysis, and dynamics of Bayesian games via matrix-based method
- Functional observer design for Boolean control networks with unknown structures
- Verification of coset weighted potential game and its application to optimisation of multi-agent systems
- Robust strategy optimization of networked evolutionary games with disturbance inputs
- Regulation of game result for \(n\)-person random evolutionary Boolean games
- Matrix expression of Owen values
- Exploring multi-potential games in strategic form: a graph theoretic approach
- On potential equations of finite symmetric games
- Multi-objective potential games: model, equilibrium, and applications
- STP-based verification of extended finite multi-potential games
- The minimum number of discriminant equations for a symmetric game
- Semi-tensor product approach to minimal-agent consensus control of networked evolutionary games
- From weighted potential game to weighted harmonic game
- Stochastic set stabilisation of n-person random evolutionary Boolean games and its applications
- Survey on semi-tensor product method with its applications in logical networks and other finite-valued systems
- Linear representation of symmetric games
- Engineering-application-driven developments in semi-tensor product of matrices: a survey
- On coset weighted potential game
- On reducible state variables of logical control networks
This page was built for publication: On potential equations of finite games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q273963)
