Iteration in a subspace for solving matrix games

DOI10.1134/S0965542512090035zbMATH Open1274.91025MaRDI QIDQ2836688

E. V. Chizhonkov

Publication date: 3 July 2013

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

zbMATH Keywords

variational inequalitiesminimum length solutionsymmetric matrix gamesiterating vectors

Mathematics Subject Classification ID

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

Related Items (1)

Title not available (Why is that?)

Recommendations

• Methods for solving matrix games with cross-evaluated payoffs 👍 👎
• A sublinear-time randomized approximation algorithm for matrix games 👍 👎
• Iterative strategies for solving linearized discrete mean field games systems 👍 👎
• Iterative solution of matrix games using grid variational inequalities 👍 👎
• THE SOLUTION OF SOME CLASSES OF MATRIX GAMES 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)