Pages that link to "Item:Q6488585"
From MaRDI portal
The following pages link to Two Algorithms for Computing Exact and Approximate Nash Equilibria in Bimatrix Games (Q6488585):
Displaying 9 items.
- On incremental approximate saddle-point computation in zero-sum matrix games (Q286267) (← links)
- An alternating direction method for Nash equilibrium of two-person games with alternating offers (Q353164) (← links)
- New algorithms for approximate Nash equilibria in bimatrix games (Q1041233) (← links)
- An algorithm for finding approximate Nash equilibria in bimatrix games (Q2157005) (← links)
- On the exact polynomial time algorithm for a special class of bimatrix game (Q2799636) (← links)
- (Q3397628) (← links)
- (Q3765577) (← links)
- Semidefinite Programming and Nash Equilibria in Bimatrix Games (Q4995090) (← links)
- Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games (Q5428842) (← links)