{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:52:41Z","timestamp":1781077961962,"version":"3.54.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1016\/0167-6377(95)00032-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:07:44Z","timestamp":1027602464000},"page":"53-58","source":"Crossref","is-referenced-by-count":68,"title":["A sublinear-time randomized approximation algorithm for matrix games"],"prefix":"10.1016","volume":"18","author":[{"given":"Michael D.","family":"Grigoriadis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leonid G.","family":"Khachiyan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(95)00032-0_BIB1","series-title":"Activity Analysis of Production and Allocation","article-title":"Iterative solution of games by fictitious play","volume":"Vol. 13","author":"Brown","year":"1951"},{"key":"10.1016\/0167-6377(95)00032-0_BIB2","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1953"},{"key":"10.1016\/0167-6377(95)00032-0_BIB3","series-title":"Advances in Optimization and Parallel Computing","first-page":"129","article-title":"Approximate solution of matrix games in parallel","author":"Grigoriadis","year":"1992"},{"key":"10.1016\/0167-6377(95)00032-0_BIB4","unstructured":"also available as TR91-73 from DIMACS, CoRE-Busch, Rutgers Univ., New Brunswick, NJ 08903."},{"key":"10.1016\/0167-6377(95)00032-0_BIB5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/0804004","article-title":"Fast approximation schemes for convex programs with many blocks and coupling constraints","volume":"4","author":"Grigoriadis","year":"1994","journal-title":"SIAM J. Optim."},{"key":"10.1016\/0167-6377(95)00032-0_BIB6_1","first-page":"1421","article-title":"Convergence rate of the game processes for solving matrix games","volume":"17","author":"Khachiyan","year":"1977","journal-title":"Zh. Vychisl. Mat. Mat. Fiz."},{"key":"10.1016\/0167-6377(95)00032-0_BIB6_2","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/0041-5553(77)90174-4","volume":"17","author":"Khachiyan","year":"1978","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"10.1016\/0167-6377(95)00032-0_BIB7","first-page":"734","article-title":"Simple strategies for large zero-sum games with applications to complexity theory","author":"Lipton","year":"1994","journal-title":"ACM Symp. on Theory of Computing"},{"key":"10.1016\/0167-6377(95)00032-0_BIB8","series-title":"ACM Symp. on Theory of Computing","first-page":"448","article-title":"A parallel approximation algorithm for positive linear programming","author":"Luby","year":"1993"},{"key":"10.1016\/0167-6377(95)00032-0_BIB9","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/moor.20.2.257","article-title":"Fast approximation algorithms for fractional packing and covering problems","volume":"20","author":"Plotkin","year":"1995","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0167-6377(95)00032-0_BIB10","doi-asserted-by":"crossref","first-page":"296","DOI":"10.2307\/1969530","article-title":"An iterative method of solving a game","volume":"54","author":"Robinson","year":"1951","journal-title":"Ann. Math."},{"key":"10.1016\/0167-6377(95)00032-0_BIB11","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1002\/cpa.3160110408","article-title":"Note on a computation method in the theory of games","volume":"11","author":"Shapiro","year":"1958","journal-title":"Comm. Pure Appl. Math."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637795000320?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637795000320?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T21:27:51Z","timestamp":1556573271000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637795000320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["0167637795000320"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(95)00032-0","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}