Pages that link to "Item:Q1678770"
From MaRDI portal
The following pages link to Random bimatrix games are asymptotically easy to solve (a simple proof) (Q1678770):
Displaying 5 items.
- A Glimpse at Paul G. Spirakis (Q3464465) (← links)
- On Random Symmetric Bimatrix Games (Q5012901) (← links)
- Constant rank bimatrix games are PPAD-hard (Q5259590) (← links)
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559) (← links)
- Two Algorithms for Computing Exact and Approximate Nash Equilibria in Bimatrix Games (Q6488585) (← links)