A continuation method for Nash equilibria in structured games
From MaRDI portal
Publication:3624005
zbMATH Open1165.91309arXiv1110.5886MaRDI QIDQ3624005FDOQ3624005
Authors:
Publication date: 28 April 2009
Full work available at URL: https://arxiv.org/abs/1110.5886
Recommendations
- Multi-agent influence diagrams for representing and solving games.
- Equilibrium computation for two-player games in strategic and extensive form
- Computing Nash Equilibria in Multiplayer DAG-Structured Stochastic Games with Persistent Imperfect Information
- Efficient computation of equilibria for extensive two-person games
- Computing Nash equilibria by iterated polymatrix approximation
Cited In (13)
- Pure Nash Equilibria in Resource Graph Games
- On the complexity of constrained Nash equilibria in graphical games
- Action-graph games
- A constructive approach to sequential Nash equilibria
- Homotopy Continuation Method for Discounted Zero-Sum Stochastic Game with ARAT Structure
- An approach for reducing the graphical model and genetic algorithm for computing approximate Nash equilibrium in static games
- Simple search methods for finding a Nash equilibrium
- An alternating direction method for Nash equilibrium of two-person games with alternating offers
- Interval methods for computing strong Nash equilibria of continuous games
- Global Newton method for stochastic games
- A dynamical method for the calculation of Nash-equilibria inn-person games
- A dynamical neural network approach for solving stochastic two-player zero-sum games
- A decomposition algorithm for \(N\)-player games
This page was built for publication: A continuation method for Nash equilibria in structured games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624005)
