{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T02:07:51Z","timestamp":1773799671067,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1995,11]]},"DOI":"10.1016\/0305-0548(94)00075-j","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"893-903","source":"Crossref","is-referenced-by-count":9,"title":["Modified fictitious play for solving matrix games and linear-programming problems"],"prefix":"10.1016","volume":"22","author":[{"given":"Saul I.","family":"Gass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo M.R.","family":"Zafra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)00075-J_BIB1","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1963"},{"key":"10.1016\/0305-0548(94)00075-J_BIB2","series-title":"Contributions to the Theory of Games","first-page":"73","article-title":"Solutions of games by differential equations","volume":"Vol. 1","author":"Brown","year":"1950"},{"key":"10.1016\/0305-0548(94)00075-J_BIB3","series-title":"Activity Analysis of Production and Allocation","first-page":"374","article-title":"Iterative solution of games by fictitious play","author":"Brown","year":"1951"},{"key":"10.1016\/0305-0548(94)00075-J_BIB4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/nav.3800010207","article-title":"A numerical method to determine optimum strategy","volume":"1","author":"von Neumann","year":"1954","journal-title":"Naval Res. Logist. Q."},{"key":"10.1016\/0305-0548(94)00075-J_BIB5","doi-asserted-by":"crossref","first-page":"296","DOI":"10.2307\/1969530","article-title":"An iterative method of solving a game","volume":"53","author":"Robinson","year":"1951","journal-title":"Ann. Math."},{"key":"10.1016\/0305-0548(94)00075-J_BIB6","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":"XI","author":"Shapiro","year":"1958","journal-title":"Commun. Pure Appl. Math."},{"key":"10.1016\/0305-0548(94)00075-J_BIB7","series-title":"Introduction to the Theory of Games","author":"Sz\u00e9p","year":"1985"},{"key":"10.1016\/0305-0548(94)00075-J_BIB8","series-title":"Linear Programming","author":"Gass","year":"1985"},{"key":"10.1016\/0305-0548(94)00075-J_BIB9","series-title":"Contributions to the Theory of Games","first-page":"73","article-title":"On symmetric games","volume":"Vol. 1","author":"Gale","year":"1950"},{"key":"10.1016\/0305-0548(94)00075-J_BIB10","author":"Marsten","year":"1989"},{"key":"10.1016\/0305-0548(94)00075-J_BIB11","article-title":"Recovering an optimal LP basis from an interior point solution","author":"Bixby","year":"1991"},{"key":"10.1016\/0305-0548(94)00075-J_BIB12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/ijoc.1.4.287","article-title":"Implementation of a dual affine interior point algorithm for linear programming","volume":"1","author":"Marsten","year":"1989","journal-title":"ORSA J. on Computing"},{"key":"10.1016\/0305-0548(94)00075-J_BIB13","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/ijoc.3.1.63","article-title":"On finding primal- and dual-optimal bases","volume":"3","author":"Megiddo","year":"1991","journal-title":"ORSA J. on Computing"},{"key":"10.1016\/0305-0548(94)00075-J_BIB14","article-title":"Electronic mail distribution of linear programming test problems","author":"Gay","year":"1985","journal-title":"Mathematical Programming Society Coal Newsletter"},{"key":"10.1016\/0305-0548(94)00075-J_BIB15","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0305-0548(89)90018-X","article-title":"An analysis of an available set of linear programming test problems","volume":"16","author":"Lustig","year":"1989","journal-title":"Computers Ops Res"},{"key":"10.1016\/0305-0548(94)00075-J_BIB16","series-title":"Contributions to the Theory of Games","first-page":"89","article-title":"Reduction of game matrices","volume":"Vol. 1","author":"Gale","year":"1950"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489400075J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489400075J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T20:59:55Z","timestamp":1555189195000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489400075J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":16,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["030505489400075J"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)00075-j","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}