Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach

DOI10.1007/978-3-540-74456-6_53zbMATH Open1147.91309OpenAlexW1562075046MaRDI QIDQ3525604FDOQ3525604

Authors: Spyros Kontogiannis, P. G. Spirakis 

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_53

Recommendations

• Well supported approximate equilibria in bimatrix games
• Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
• Polylogarithmic supports are required for approximate well-supported Nash equilibria below 2/3
• Approximate well-supported Nash equilibria in symmetric bimatrix games
• Large Supports are required for Well-Supported Nash Equilibria

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43)

Cited In (5)

• Approximate Equilibria for Strategic Two Person Games
• Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
• Random bimatrix games are asymptotically easy to solve (a simple proof)
• Well supported approximate equilibria in bimatrix games
• Polylogarithmic supports are required for approximate well-supported Nash equilibria below 2/3

This page was built for publication: Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach

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