Pages that link to "Item:Q5301416"
From MaRDI portal
The following pages link to A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games (Q5301416):
Displaying 6 items.
- On mutual concavity and strategically-zero-sum bimatrix games (Q428856) (← links)
- The complexity of uniform Nash equilibria and related regular subgraph problems (Q935157) (← links)
- Well supported approximate equilibria in bimatrix games (Q973002) (← links)
- Parameterized two-player Nash equilibrium (Q1949741) (← links)
- The complexity of computational problems about Nash equilibria in symmetric win-lose games (Q2659767) (← links)
- Some Tractable Win-Lose Games (Q3010417) (← links)
