Random bimatrix games are asymptotically easy to solve (a simple proof)

DOI10.1007/978-3-642-24829-0_18zbMATH Open1233.91029OpenAlexW2185535416MaRDI QIDQ3095273FDOQ3095273

Authors: Panagiota N. Panagopoulou, P. G. Spirakis 

Publication date: 28 October 2011

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24829-0_18

Recommendations

• Random bimatrix games are asymptotically easy to solve (a simple proof)
• Nash equilibria in random games
• On random symmetric bimatrix games
• Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach
• Approximate well-supported Nash equilibria in symmetric bimatrix games

Mathematics Subject Classification ID

Noncooperative games (91A10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Stochastic games, stochastic differential games (91A15)

Cited In (3)

• Constant rank bimatrix games are PPAD-hard
• Random bimatrix games are asymptotically easy to solve (a simple proof)
• On random symmetric bimatrix games

This page was built for publication: Random bimatrix games are asymptotically easy to solve (a simple proof)

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