{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:36:46Z","timestamp":1725543406373},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540351573"},{"type":"electronic","value":"9783540351580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11775096_8","type":"book-chapter","created":{"date-parts":[[2006,6,22]],"date-time":"2006-06-22T04:40:18Z","timestamp":1150951218000},"page":"64-78","source":"Crossref","is-referenced-by-count":3,"title":["Linear Programming Polytope and Algorithm for Mean Payoff Games"],"prefix":"10.1007","author":[{"given":"Ola","family":"Svensson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergei","family":"Vorobyov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Bj\u00f6rklund, H., Nilsson, O., Svensson, O., Vorobyov, S.: Controlled linear programming: Boundedness and duality. Technical Report DIMACS-2004-56, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ (December 2004), http:\/\/dimacs.rutgers.edu\/TechnicalReports\/"},{"key":"8_CR2","unstructured":"Bj\u00f6rklund, H., Nilsson, O., Svensson, O., Vorobyov, S.: The controlled linear programming problem. Technical Report DIMACS-2004-41, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ (September 2004)"},{"key":"8_CR3","unstructured":"Bj\u00f6rklund, H., Svensson, O., Vorobyov, S.: 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":"8_CR4","unstructured":"Bj\u00f6rklund, H., Svensson, O., Vorobyov, S.: 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)"},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.tcs.2005.07.041","volume":"349","author":"H. Bj\u00f6rklund","year":"2005","unstructured":"Bj\u00f6rklund, H., Vorobyov, S.: Combinatorial structure and randomized subexponential algorithms for infinite games. Theoretical Computer Science\u00a0349(3), 347\u2013360 (2005)","journal-title":"Theoretical Computer Science"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, H., Vorobyov, S.: A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. Discrete Applied Mathematics (accepted, 2006); Preliminary version in: MFCS 2004. LNCS, vol.\u00a03153, pp. 673\u2013685. Springer, Heidelberg (to appear, 2004) DIMACS TR 2004-05","DOI":"10.1016\/j.dam.2006.04.029"},{"key":"8_CR7","volume-title":"The Linear Complementarity Problem","author":"R.W. Cottle","year":"1992","unstructured":"Cottle, R.W., Pang, J.-S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, London (1992)"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01768705","volume":"8","author":"A. Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. International Journ. of Game Theory\u00a08, 109\u2013113 (1979)","journal-title":"International Journ. of Game Theory"},{"issue":"5","key":"8_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0041-5553(88)90012-2","volume":"28","author":"V.A. Gurvich","year":"1988","unstructured":"Gurvich, V.A., Karzanov, A.V., Khachiyan, L.G.: Cyclic games and an algorithm to find minimax cycle means in directed graphs. U.S.S.R. Computational Mathematics and Mathematical Physics\u00a028(5), 85\u201391 (1988)","journal-title":"U.S.S.R. Computational Mathematics and Mathematical Physics"},{"key":"8_CR10","volume-title":"Linear Complementarity, Linear and Nonlinear Programming","author":"K.G. Murty","year":"1988","unstructured":"Murty, K.G., Yu, F.-T.: Linear Complementarity, Linear and Nonlinear Programming. Heldermann Verlag, Berlin (1988)"},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1287\/moor.24.4.817","volume":"24","author":"N. Pisaruk","year":"1999","unstructured":"Pisaruk, N.: Mean cost cyclical games. Mathematics of Operations Research\u00a024(4), 817\u2013828 (1999)","journal-title":"Mathematics of Operations Research"},{"key":"8_CR12","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, Chichester (1986)"},{"key":"8_CR13","volume-title":"Combinatorial Optimization","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization, vol.\u00a01-3. Springer, Heidelberg (2003)"},{"key":"8_CR14","unstructured":"Svensson, O., Vorobyov, S.: 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":"8_CR15","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U. Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci.\u00a0158, 343\u2013359 (1996)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11775096_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:14:47Z","timestamp":1619493287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11775096_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540351573","9783540351580"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11775096_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}