Approximate Nash Equilibria for Multi-player Games
From MaRDI portal
Publication:5459991
DOI10.1007/978-3-540-79309-0_24zbMATH Open1136.91325OpenAlexW1513282132MaRDI QIDQ5459991FDOQ5459991
Authors: Sébastien Hémon, Michel de Rougemont, Miklos Santha 
Publication date: 2 May 2008
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79309-0_24
Recommendations
Cites Work
- Non-cooperative games
- An optimization approach for approximate Nash equilibria
- Title not available (Why is that?)
- Equilibrium Points of Bimatrix Games
- A note on approximate Nash equilibria
- New algorithms for approximate Nash equilibria in bimatrix games
- Title not available (Why is that?)
- The complexity of computing a Nash equilibrium
Cited In (15)
- Approximation and characterization of Nash equilibria of large games
- Empirical Distribution of Equilibrium Play and Its Testing Application
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Noninferior Nash strategies for multi-team systems
- Nash equilibrium in generalised Muller games
- Approximations of Nash equilibria
- A financial market with interacting investors: does an equilibrium exist?
- Successful Nash equilibrium agent for a three-player imperfect-information game
- Computing approximate Nash equilibria in polymatrix games
- On Nash-equilibria of approximation-stable games
- Inapproximability of Nash Equilibrium
- A dynamical method for the calculation of Nash-equilibria inn-person games
- Probabilistic Techniques in Algorithmic Game Theory
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)
