Computing exact and approximate Nash equilibria in 2-player games

DOI10.1007/978-3-642-14355-7_7MaRDI QIDQ3578358zbMATH OpenOpenAlexFDO

Authors Vittorio Bilò, Angelo Fanelli

Publication date 20 July 2010

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14355-7_7

Mathematics Subject Classification ID

2-person games (91A05)

Recommendations

• Polynomial algorithms for approximating Nash equilibria of bimatrix games
• New algorithms for approximate Nash equilibria in bimatrix games
• An optimization approach for approximate Nash equilibria
• Settling the complexity of computing two-player Nash equilibria
• Computing approximate Nash equilibria in polymatrix games

Cited in

(15)

• Polynomial algorithms for approximating Nash equilibria of bimatrix games
• New algorithms for approximate Nash equilibria in bimatrix games
• An algorithm for finding approximate Nash equilibria in bimatrix games
• The complexity of computational problems about Nash equilibria in symmetric win-lose games
• Computing approximate Nash equilibria in polymatrix games
• Computing approximate Nash equilibria in general network revenue management games
• An optimization approach for approximate Nash equilibria
• The Effective Computation of Equilibrium Point for N-Person Games Cyclic to the Next Person
• Nash equilibria in perturbation-stable games
• Computing approximate Nash equilibria in polymatrix games
• Sum-of-squares meets Nash: lower bounds for finding any equilibrium
• Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
• The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming
• Two Algorithms for Computing Exact and Approximate Nash Equilibria in Bimatrix Games
• Computing Nash equilibria by iterated polymatrix approximation

This page was built for publication: Computing exact and approximate Nash equilibria in 2-player games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578358)