{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:20:39Z","timestamp":1776316839444,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6286,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1016\/0304-3975(95)00188-3","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"343-359","source":"Crossref","is-referenced-by-count":316,"title":["The complexity of mean payoff games on graphs"],"prefix":"10.1016","volume":"158","author":[{"given":"Uri","family":"Zwick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Paterson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00188-3_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-247X(91)90217-N","article-title":"Cycles in extensive form perfect information games","volume":"159","author":"Alpern","year":"1991","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0304-3975(95)00188-3_BIB2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0304-3975(93)90357-Y","article-title":"Complexity of path-forming games","volume":"110","author":"Bodlaender","year":"1993","journal-title":"Theoret Comput Sci."},{"key":"10.1016\/0304-3975(95)00188-3_BIB3","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1145\/146585.146588","article-title":"An optimal on-line algorithm for metrical task system","volume":"39","author":"Borodin","year":"1992","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00188-3_BIB4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(92)90039-D","article-title":"An O(n2) algorithm for the maximum cycle mean of an n \u00d7 n bivalent matrix","volume":"35","author":"Butkovic","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(95)00188-3_BIB5","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/S0097539793245829","article-title":"Tighter lower bounds on the exact complexity of string matching","volume":"24","author":"Cole","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00188-3_BIB6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","article-title":"The complexity of stochastic games","volume":"96","author":"Condon","year":"1992","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(95)00188-3_BIB7","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/0304-3975(95)00188-3_BIB8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01768705","article-title":"Positional strategies for mean payoff games","volume":"8","author":"Ehrenfeucht","year":"1979","journal-title":"Int. J. Game Theory"},{"key":"10.1016\/0304-3975(95)00188-3_BIB9","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0304-3975(93)90026-P","article-title":"Undirected edge geography","volume":"112","author":"Fraenkel","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00188-3_BIB10","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0304-3975(93)90356-X","article-title":"Geography","volume":"110","author":"Fraenkel","year":"1993","journal-title":"Theoret Comput. Sci."},{"key":"10.1016\/0304-3975(95)00188-3_BIB11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0041-5553(88)90012-2","article-title":"Cyclic games and an algorithm to find minimax cycle means in directed graphs","volume":"28","author":"Gurvich","year":"1988","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"10.1016\/0304-3975(95)00188-3_BIB12","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","article-title":"A characterization of the minimum cycle mean in a digraph","volume":"23","author":"Karp","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(95)00188-3_BIB13","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01580616","article-title":"Cyclical games with prohibitions","volume":"60","author":"Karzanov","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/0304-3975(95)00188-3_BIB14","first-page":"93","article-title":"Algorithms to solve some classes of network minimax problems and their applications","volume":"29","author":"Lozovanu","year":"1991","journal-title":"Cybernetics"},{"key":"10.1016\/0304-3975(95)00188-3_BIB15","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1007\/BF01125805","article-title":"Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games","volume":"29","author":"Lozovanu","year":"1993","journal-title":"Cybernetics Systems Anal."},{"key":"10.1016\/0304-3975(95)00188-3_BIB16","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1006\/inco.1995.1035","article-title":"A subexponential randomized algorithm for the simple stochastic game problem","volume":"117","author":"Ludwig","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(95)00188-3_BIB17","article-title":"On the complexity of the policy iteration algorithm for stochastic games","author":"Melekopoglou","year":"1990"},{"key":"10.1016\/0304-3975(95)00188-3_BIB18","article-title":"Prolongement des jeux a deux joueurs de somme nulle","volume":"45","author":"Moulin","year":"1976","journal-title":"Bull. Soc. Math. France, Memoires"},{"key":"10.1016\/0304-3975(95)00188-3_BIB19","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","article-title":"Selection and sorting with limited storage","volume":"12","author":"Munro","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00188-3_BIB20","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01586040","article-title":"New scaling algorithms for the assignment and minimum mean cycle problems","volume":"54","author":"Orlin","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/0304-3975(95)00188-3_BIB21","article-title":"Surveys in game theory and related topics","author":"Peters","year":"1987"},{"key":"10.1016\/0304-3975(95)00188-3_BIB22","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0204018","article-title":"Every prime has a succinct certificate","volume":"4","author":"Pratt","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00188-3_BIB23","first-page":"1095","article-title":"Stochastic games","volume":"39","author":"Shapley","year":"1953"},{"key":"10.1016\/0304-3975(95)00188-3_BIB24","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.3230210206","article-title":"Faster parametric shortest path and minimum-balance algorithms","volume":"21","author":"Young","year":"1991","journal-title":"Networks"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001883?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001883?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:53:03Z","timestamp":1555419183000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001883"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0304397595001883"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00188-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}