A distributed proximal-point algorithm for Nash equilibrium seeking in generalized potential games with linearly coupled cost functions.
Giuseppe BelgioiosoSergio GrammaticoPublished in: ECC (2019)
Keyphrases
- nash equilibrium
- game theory
- cost function
- nash equilibria
- game theoretic
- solution concepts
- pareto optimal
- pure strategy
- mixed strategy
- stackelberg game
- fictitious play
- pure nash equilibria
- cooperative
- congestion games
- repeated games
- regret minimization
- stochastic games
- worst case
- variational inequalities
- proximal point algorithm
- pure nash equilibrium
- multi agent
- incomplete information
- imperfect information
- equilibrium strategies
- cooperative games
- general sum games
- decision problems
- markov random field
- higher order
- multi agent systems
- objective function