Approximate Nash Equilibria for Multi-player Games

DOI10.1007/978-3-540-79309-0_24zbMath1136.91325OpenAlexW1513282132MaRDI QIDQ5459991

Michel de Rougemont, Miklos Santha, Sébastien Hémon

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

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Games in extensive form (91A18)

Related Items (4)

Inapproximability of Nash Equilibrium ⋮ A financial market with interacting investors: does an equilibrium exist? ⋮ Empirical Distribution of Equilibrium Play and Its Testing Application ⋮ Computing approximate Nash equilibria in polymatrix games

Cites Work

• A note on approximate Nash equilibria
• New algorithms for approximate Nash equilibria in bimatrix games
• Non-cooperative games
• The complexity of computing a Nash equilibrium
• An Optimization Approach for Approximate Nash Equilibria
• Equilibrium Points of Bimatrix Games
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate Nash Equilibria for Multi-player Games