Iteration in a subspace for solving matrix games

DOI10.1134/S0965542512090035zbMATH Open1274.91025MaRDI QIDQ2836688FDOQ2836688

Authors: E. V. Chizhonkov 

Publication date: 3 July 2013

Published in: Zhurnal Vychislitel'noĭ Matematiki i Matematicheskoĭ Fiziki (Search for Journal in Brave)

Recommendations

• Iterative solution of matrix games using grid variational inequalities
• scientific article
• 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

zbMATH Keywords

variational inequalitiesminimum length solutionsymmetric matrix gamesiterating vectors

Mathematics Subject Classification ID

Preconditioners for iterative methods (65F08) Noncooperative games (91A10) Computational methods for problems pertaining to game theory, economics, and finance (91-08)

Cited In (6)

• Iterative solution of matrix games using grid variational inequalities
• Title not available (Why is that?)
• Geometrically convergent projection method in matrix games
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ellipsoid projection method in matrix games

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)