论文信息 - A sublinear-time randomized approximation algorithm for matrix games - 字舞流文

A sublinear-time randomized approximation algorithm for matrix games

Leonid Khachiyan | Michael D. Grigoriadis | L. Khachiyan | M. Grigoriadis

[1] Richard J. Lipton,et al. Simple strategies for large zero-sum games with applications to complexity theory , 1994, STOC '94.

[2] Leonid Khachiyan,et al. Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints , 1994, SIAM J. Optim..

[3] Noam Nisan,et al. A parallel approximation algorithm for positive linear programming , 1993, STOC.

[4] Panos M. Pardalos,et al. Advances in Optimization and Parallel Computing , 1992 .

[5] Éva Tardos,et al. Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[6] L. Khachiyan. Convergence rate of the game processes for solving matrix games , 1977 .

[7] George B. Dantzig,et al. Linear programming and extensions , 1965 .

[8] H. N. Shapiro. Note on a Computation Method in the Theory of Games , 1958 .