Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof)

DOI10.1007/978-3-642-24829-0_18zbMath1233.91029OpenAlexW2185535416MaRDI QIDQ3095273

Panagiota N. Panagopoulou, Paul 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

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)

Related Items (1)

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

This page was built for publication: Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof)