Iteration in a subspace for solving matrix games
From MaRDI portal
Publication:2836688
Recommendations
- Iterative solution of matrix games using grid variational inequalities
- scientific article; zbMATH DE number 60256
- An interior-point algorithm for matrix games
- scientific article; zbMATH DE number 579344
- A sublinear-time randomized approximation algorithm for matrix games
- The solution of some classes of matrix games
- scientific article; zbMATH DE number 3876470
- Methods for solving matrix games with cross-evaluated payoffs
- scientific article; zbMATH DE number 724209
- Iterative strategies for solving linearized discrete mean field games systems
Cited in
(11)- A direct linear programming algorithm for solving matrix games
- Numerical solution of special matrix games
- Iterative solution of matrix games using grid variational inequalities
- Matrix norm based hybrid Shapley and iterative methods for the solution of stochastic matrix games
- scientific article; zbMATH DE number 3328013 (Why is no real title available?)
- Geometrically convergent projection method in matrix games
- scientific article; zbMATH DE number 4189498 (Why is no real title available?)
- scientific article; zbMATH DE number 60256 (Why is no real title available?)
- Iterative computation of security strategies of matrix games with growing action set
- Ellipsoid projection method in matrix games
- A new method to investigate the optimal solutions of game theory problems
This page was built for publication: Iteration in a subspace for solving matrix games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2836688)
