Pages that link to "Item:Q2157005"
From MaRDI portal
The following pages link to An algorithm for finding approximate Nash equilibria in bimatrix games (Q2157005):
Displaying 8 items.
- An alternating direction method for Nash equilibrium of two-person games with alternating offers (Q353164) (← links)
- Computing Nash equilibria by iterated polymatrix approximation (Q953636) (← links)
- (Q3397628) (← links)
- (Q3765577) (← links)
- Fast Algorithms for Rank-1 Bimatrix Games (Q4994178) (← links)
- Semidefinite Programming and Nash Equilibria in Bimatrix Games (Q4995090) (← links)
- Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games (Q5428842) (← links)
- Two Algorithms for Computing Exact and Approximate Nash Equilibria in Bimatrix Games (Q6488585) (← links)