On potential equations of finite games
From MaRDI portal
Publication:273963
DOI10.1016/j.automatica.2016.01.074zbMath1414.91014arXiv1504.07342OpenAlexW821019010MaRDI QIDQ273963
Publication date: 22 April 2016
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.07342
Noncooperative games (91A10) 2-person games (91A05) Games involving graphs (91A43) (n)-person games, (n>2) (91A06)
Related Items (24)
Matrix approach to verification of finite multi-potential games ⋮ On reducible state variables of logical control networks ⋮ On congestion games with player-specific costs and resource failures ⋮ Algebraic formulation and Nash equilibrium of competitive diffusion games ⋮ A congestion game framework for service chain composition in NFV with function benefit ⋮ Global robust stability and stabilization of Boolean network with disturbances ⋮ On basis and pure Nash equilibrium of finite pure harmonic games ⋮ Modeling, analysis, and dynamics of Bayesian games via matrix-based method ⋮ Functional observer design for Boolean control networks with unknown structures ⋮ Analyses and encryption implementation of a new chaotic system based on semitensor product ⋮ Incomplete-profile potential games ⋮ Recent advances in optimization and game theoretic control for networked systems ⋮ Stochastic stability and stabilization of \(n\)-person random evolutionary Boolean games ⋮ Optimal control of Boolean control networks with average cost: a policy iteration approach ⋮ Nash-stable coalition partition and potential functions in games with coalition structure ⋮ Model matching of switched asynchronous sequential machines via matrix approach ⋮ Potential functions for finding stable coalition structures ⋮ 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 ⋮ Optimal control of random evolutionary Boolean games ⋮ Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices ⋮ A Matrix Approach to the Analysis and Control of Networked Evolutionary Games with Bankruptcy Mechanism ⋮ Modelling and strategy consensus for a class of networked evolutionary games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On finite potential games
- An improved algorithm for detecting potential games
- Decompositions and potentials for normal form games
- Analysis and control of Boolean networks. A semi-tensor product approach.
- A Shapley value representation of potential games
- Potential games
- Algebraic formulation and strategy optimization for a class of evolutionary networked games via semi-tensor product method
- A class of games possessing pure-strategy Nash equilibria
- Selfish unsplittable flows
- Non-cooperative games
- Flows and Decompositions of Games: Harmonic and Potential Games
- On Decomposed Subspaces of Finite Games
- Modeling, Analysis and Control of Networked Evolutionary Games
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games
This page was built for publication: On potential equations of finite games
