Convergence rate of the game processes for solving matrix games

DOI10.1016/0041-5553(77)90174-4zbMATH Open0395.90048OpenAlexW2000904706MaRDI QIDQ4178775FDOQ4178775

Authors: Leonid G. Khachiyan 

Publication date: 1977

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(77)90174-4

zbMATH Keywords

linear programmingconvergencecomputational efficiencyiterative solutionmatrix games

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) 2-person games (91A05)

Cited In (2)

• A sublinear-time randomized approximation algorithm for matrix games
• Scientific contributions of Leo Khachiyan (a short overview)

This page was built for publication: Convergence rate of the game processes for solving matrix games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178775)