{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T15:14:01Z","timestamp":1680794041938},"reference-count":43,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":2821,"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":[[2005,12]]},"DOI":"10.1016\/j.tcs.2005.07.041","type":"journal-article","created":{"date-parts":[[2005,10,3]],"date-time":"2005-10-03T13:40:34Z","timestamp":1128346834000},"page":"347-360","source":"Crossref","is-referenced-by-count":21,"title":["Combinatorial structure and randomized subexponential algorithms for infinite games"],"prefix":"10.1016","volume":"349","author":[{"given":"Henrik","family":"Bj\u00f6rklund","sequence":"first","affiliation":[]},{"given":"Sergei","family":"Vorobyov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2005.07.041_bib1","unstructured":"E. Aarts, J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization, Wiley, New York, 1997."},{"key":"10.1016\/j.tcs.2005.07.041_bib2","unstructured":"H. Bj\u00f6rklund, S. Sandberg, S. Vorobyov, Optimization on completely unimodal hypercubes, Technical Report 2002-018, Uppsala University\/Information Technology, May 2002 ."},{"key":"10.1016\/j.tcs.2005.07.041_bib3","doi-asserted-by":"crossref","unstructured":"H. Bj\u00f6rklund, S. Sandberg, S. Vorobyov, A discrete subexponential algorithm for parity games, in: H. Al, M. Habib (Eds.), 20th Internat. Symp. on Theoretical Aspects of Computer Science, STACS\u20192003, Lecture Notes in Computer Science, Vol. 2607, Springer, Berlin, 2003, pp. 663\u2013674 (Full preliminary version: TR-2002-026, Department of Information Technology, Uppsala University, September 2002).","DOI":"10.1007\/3-540-36494-3_58"},{"key":"10.1016\/j.tcs.2005.07.041_bib4","first-page":"381","article-title":"Complexity of model checking by iterative improvement: the pseudo-Boolean framework","volume":"Vol. 2890","author":"Bj\u00f6rklund","year":"2003"},{"key":"10.1016\/j.tcs.2005.07.041_bib5","unstructured":"H. Bj\u00f6rklund, S. Sandberg, S. Vorobyov, On combinatorial structure and algorithms for parity games, Technical Report 2003-002, Department of Information Technology, Uppsala University, January 2003 ."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2005.07.041_bib6","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0304-3975(03)00427-4","article-title":"Memoryless determinacy of parity and mean payoff games: a simple proof","volume":"310","author":"Bj\u00f6rklund","year":"2004","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2005.07.041_bib7","unstructured":"H. Bj\u00f6rklund, O. Svensson, S. Vorobyov, Linear complementarity algorithms for mean payoff games, Technical Report DIMACS-2005-05, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ, February 2005 ."},{"key":"10.1016\/j.tcs.2005.07.041_bib8","unstructured":"H. Bj\u00f6rklund, O. Svensson, S. Vorobyov, Controlled linear programming for infinite games, Technical Report DIMACS-2005-13, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ, April 2005 ."},{"key":"10.1016\/j.tcs.2005.07.041_bib9","doi-asserted-by":"crossref","unstructured":"H. Bj\u00f6rklund, S. Vorobyov, A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games, Preliminary version in MFCS\u201904, Lecture Notes in Computer Science, Vol. 3153, Springer, Berlin, 2005, pp. 673\u2013685, and DIMACS TR 2004-05, Discrete Appl. Math., to appear.","DOI":"10.1007\/978-3-540-28629-5_52"},{"key":"10.1016\/j.tcs.2005.07.041_bib10","unstructured":"E. Boros, P.L. Hammer, Pseudo-Boolean optimization, Technical Report RRR 48-2001, RUTCOR Rutger Center for Operations Research, 2001."},{"key":"10.1016\/j.tcs.2005.07.041_bib11","series-title":"Model Checking","author":"Clarke","year":"2000"},{"key":"10.1016\/j.tcs.2005.07.041_bib12","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\/j.tcs.2005.07.041_bib13","doi-asserted-by":"crossref","unstructured":"A. Condon, On algorithms for simple stochastic games, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 13, 1993, pp. 51\u201371.","DOI":"10.1090\/dimacs\/013\/04"},{"key":"10.1016\/j.tcs.2005.07.041_bib14","series-title":"Finite-State Markovian Decision Processes","author":"Derman","year":"1970"},{"key":"10.1016\/j.tcs.2005.07.041_bib15","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":"Internat. J. Game Theory"},{"key":"10.1016\/j.tcs.2005.07.041_bib16","first-page":"185","article-title":"Model checking and the Mu-calculus","volume":"Vol. 31","author":"Emerson","year":"1997"},{"key":"10.1016\/j.tcs.2005.07.041_bib17","doi-asserted-by":"crossref","unstructured":"E.A. Emerson, C.S. Jutla, Tree automata, \u03bc-calculus and determinacy, in: Annu. IEEE Symp. on Foundations of Computer Science, 1991, pp. 368\u2013377.","DOI":"10.1109\/SFCS.1991.185392"},{"key":"10.1016\/j.tcs.2005.07.041_bib18","series-title":"Competitive Markov Decision Processes","author":"Filar","year":"1996"},{"key":"10.1016\/j.tcs.2005.07.041_bib19","unstructured":"E. Gr\u00e4del, W. Thomas, T. Wilke (Eds.), Automata Logics and Infinite Games. A Guide to Current Research, Lecture Notes in Computer Science, Vol. 2500, Springer, Berlin, 2003."},{"issue":"5","key":"10.1016\/j.tcs.2005.07.041_bib20","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":"1998","journal-title":"U.S.S.R. Comput. Math. Math. Phys."},{"issue":"2","key":"10.1016\/j.tcs.2005.07.041_bib21","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1137\/0401019","article-title":"From linear separability to unimodality: a hierarchy of pseudo-Boolean functions","volume":"1","author":"Hammer","year":"1988","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"10.1016\/j.tcs.2005.07.041_bib22","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/ijoc.5.2.97","article-title":"Constrained nonlinear 0\u20131 programming (state-of-the-art survey)","volume":"5","author":"Hansen","year":"1993","journal-title":"ORSA J. Comput."},{"issue":"5","key":"10.1016\/j.tcs.2005.07.041_bib23","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1287\/mnsc.12.5.359","article-title":"On nonterminating stochastic games","volume":"12","author":"Hoffman","year":"1966","journal-title":"Management Sci."},{"key":"10.1016\/j.tcs.2005.07.041_bib24","series-title":"Dynamic Programming and Markov Processes","author":"Howard","year":"1960"},{"key":"10.1016\/j.tcs.2005.07.041_bib25","first-page":"290","article-title":"Small progress measures for solving parity games","volume":"Vol. 1770","author":"Jurdzi\u0144ski","year":"2000"},{"key":"10.1016\/j.tcs.2005.07.041_bib26","doi-asserted-by":"crossref","unstructured":"G. Kalai, A subexponential randomized simplex algorithm, in: 24th ACM STOC, 1992, pp. 475\u2013482.","DOI":"10.1145\/129712.129759"},{"key":"10.1016\/j.tcs.2005.07.041_bib27","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF02614318","article-title":"Linear programming, the simplex algorithm and simple polytopes","volume":"79","author":"Kalai","year":"1997","journal-title":"Math. Programming (Ser. B)"},{"key":"10.1016\/j.tcs.2005.07.041_bib28","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\/j.tcs.2005.07.041_bib29","doi-asserted-by":"crossref","unstructured":"J. Matou\u0161ek, M. Sharir, M. Welzl, A subexponential bound for linear programming, in: eighth ACM Symp. on Computational Geometry, 1992, pp. 1\u20138.","DOI":"10.1145\/142675.142678"},{"key":"10.1016\/j.tcs.2005.07.041_bib30","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1007\/BF01940877","article-title":"A subexponential bound for linear programming","volume":"16","author":"Matou\u0161ek","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2005.07.041_bib31","doi-asserted-by":"crossref","unstructured":"C. Papadimitriou, Algorithms, games, and the internet, in: ACM Annu. Symp. on Theory of Computing, ACM, New York, July 2001, pp. 749\u2013753.","DOI":"10.1145\/380752.380883"},{"issue":"4","key":"10.1016\/j.tcs.2005.07.041_bib32","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1287\/moor.24.4.817","article-title":"Mean cost cyclical games","volume":"24","author":"Pisaruk","year":"1999","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.tcs.2005.07.041_bib33","unstructured":"A. Puri, Theory of hybrid systems and discrete events systems, Ph.D. Thesis, EECS University of Berkeley, 1995."},{"key":"10.1016\/j.tcs.2005.07.041_bib34","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1073\/pnas.39.10.1095","article-title":"Stochastic games","volume":"39","author":"Shapley","year":"1953","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"10.1016\/j.tcs.2005.07.041_bib35","first-page":"569","article-title":"A combinatorial bound for linear programming and related problems","volume":"Vol. 577","author":"Sharir","year":"1992"},{"key":"10.1016\/j.tcs.2005.07.041_bib36","unstructured":"O. Svensson, S. Vorobyov, A subexponential algorithm for a subclass of P-matrix generalized linear complementarity problems, Technical Report DIMACS-2005-20, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ, June 2005."},{"key":"10.1016\/j.tcs.2005.07.041_bib37","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01580647","article-title":"Low order polynomial bounds on the expected performance of local improvement algorithms","volume":"35","author":"Tovey","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/j.tcs.2005.07.041_bib38","series-title":"Local Search in Combinatorial Optimization","first-page":"57","article-title":"Local improvement on discrete structures","author":"Tovey","year":"1997"},{"key":"10.1016\/j.tcs.2005.07.041_bib39","first-page":"202","article-title":"A discrete strategy improvement algorithm for solving parity games","volume":"Vol. 1855","author":"V\u00f6ge","year":"2000"},{"key":"10.1016\/j.tcs.2005.07.041_bib40","first-page":"165","article-title":"Unimodal set-functions","volume":"50","author":"Wiedemann","year":"1985","journal-title":"Congr. Numer."},{"key":"10.1016\/j.tcs.2005.07.041_bib41","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0166-218X(88)90042-X","article-title":"Completely unimodal numberings of a simple polytope","volume":"20","author":"Williamson Hoke","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2005.07.041_bib42","unstructured":"J. Zhao, V. Gurvich, L. Khachiyan, Extending Dijkstra's algorithm to shortest paths with blocks, Technical Report DIMACS-2005-04, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ, February 2005 ."},{"key":"10.1016\/j.tcs.2005.07.041_bib43","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","article-title":"The complexity of mean payoff games on graphs","volume":"158","author":"Zwick","year":"1996","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397505005761?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397505005761?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T00:52:12Z","timestamp":1586479932000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397505005761"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["S0304397505005761"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.tcs.2005.07.041","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":["General Computer Science","Theoretical Computer Science"],"published":{"date-parts":[[2005,12]]}}}