Pages that link to "Item:Q513277"
From MaRDI portal
The following pages link to Computing approximate Nash equilibria in polymatrix games (Q513277):
Displaying 9 items.
- On perfect Nash equilibria of polymatrix games (Q457873) (← links)
- Computing Nash equilibria by iterated polymatrix approximation (Q953636) (← links)
- Polynomial algorithms for approximating Nash equilibria of bimatrix games (Q1014631) (← links)
- Lipschitz continuity and approximate equilibria (Q2006946) (← links)
- Zero-sum polymatrix games: a generalization of minmax (Q2806824) (← links)
- The Computation of Approximate Generalized Feedback Nash Equilibria (Q5883327) (← links)
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559) (← links)
- PPAD-complete approximate pure Nash equilibria in Lipschitz games (Q6069844) (← links)
- PPAD-complete pure approximate Nash equilibria in Lipschitz games (Q6164508) (← links)