|
|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2012, Volume 52, Number 9, Pages 1601–1613
(Mi zvmmf9730)
|
|
|
|
Iteration in a subspace for solving matrix games
E. V. Chizhonkov Faculty of Mechanics and Mathematics, Moscow State University, Moscow, 119992 Russia
Abstract:
A new method for solving symmetric matrix games is proposed and justified. It is based on iterating vectors in the null space of a specially constructed matrix. According to the numerical tests performed, the efficiency of the proposed method is comparable with that of the available iterative algorithms having about the same computational complexity. This approach is also applicable to more complicated problems than the calculation of particular optimal strategies. For instance, it can be used for finding the unique minimum length solution.
Key words:
symmetric matrix games, variational inequalities, iterative methods in a subspace, minimum length solution.
Received: 28.07.2011 Revised: 02.04.2012
Citation:
E. V. Chizhonkov, “Iteration in a subspace for solving matrix games”, Zh. Vychisl. Mat. Mat. Fiz., 52:9 (2012), 1601–1613; Comput. Math. Math. Phys., 52:9 (2012), 1221–1232
Linking options:
https://www.mathnet.ru/eng/zvmmf9730 https://www.mathnet.ru/eng/zvmmf/v52/i9/p1601
|
|