Approximate Nash Equilibria for Multi-player Games
From MaRDI portal
(Redirected from Publication:5459991)
Recommendations
Cites work
- A note on approximate Nash equilibria
- An optimization approach for approximate Nash equilibria
- Convergence to approximate Nash equilibria in congestion games
- Equilibrium Points of Bimatrix Games
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- New algorithms for approximate Nash equilibria in bimatrix games
- Non-cooperative games
- The complexity of computing a Nash equilibrium
Cited in
(19)- Noninferior Nash strategies for multi-team systems
- Successful Nash equilibrium agent for a three-player imperfect-information game
- A financial market with interacting investors: does an equilibrium exist?
- Uniformly supported approximate equilibria in families of games
- Approximation and characterization of Nash equilibria of large games
- Nash equilibrium in generalised Muller games
- Empirical distribution of equilibrium play and its testing application
- On Nash-equilibria of approximation-stable games
- scientific article; zbMATH DE number 5283827 (Why is no real title available?)
- Probabilistic Techniques in Algorithmic Game Theory
- scientific article; zbMATH DE number 1944155 (Why is no real title available?)
- scientific article; zbMATH DE number 1738583 (Why is no real title available?)
- Inapproximability of Nash equilibrium
- Computing approximate Nash equilibria in polymatrix games
- A dynamical method for the calculation of Nash-equilibria inn-person games
- Scheduling games with potential penalties on the move of jobs
- Smooth Nash equilibria: algorithms and complexity
- Inefficiency of multiplicative approximate Nash equilibrium for scheduling games
- Approximations of Nash equilibria
This page was built for publication: Approximate Nash Equilibria for Multi-player Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459991)
