Pages that link to "Item:Q955038"
From MaRDI portal
The following pages link to On the complexity of deciding bimatrix games similarity (Q955038):
Displaying 5 items.
- The computational complexity of weak saddles (Q647484) (← links)
- On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games (Q1041739) (← links)
- Random bimatrix games are asymptotically easy to solve (a simple proof) (Q1678770) (← links)
- On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix (Q1939257) (← links)
- The complexity of computational problems about Nash equilibria in symmetric win-lose games (Q2659767) (← links)