{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T12:10:16Z","timestamp":1790251816930,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642401831","type":"print"},{"value":"9783642401848","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40184-8_35","type":"book-chapter","created":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T01:50:56Z","timestamp":1374544256000},"page":"500-515","source":"Crossref","is-referenced-by-count":12,"title":["Hyperplane Separation Technique for Multidimensional Mean-Payoff Games"],"prefix":"10.1007","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yaron","family":"Velner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"35_CR1","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.tcs.2005.11.017","volume":"354","author":"R. Alur","year":"2006","unstructured":"Alur, R., La Torre, S., Madhusudan, P.: Modular strategies for recursive game graphs. Theor. Comput. Sci.\u00a0354(2), 230\u2013249 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1145\/320613.320614","volume":"5","author":"C. Beeri","year":"1980","unstructured":"Beeri, C.: On the membership problem for functional and multivalued dependencies in relational databases. ACM Trans. on Database Systems\u00a05, 241\u2013259 (1980)","journal-title":"ACM Trans. on Database Systems"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-02658-4_14","volume-title":"Computer Aided Verification","author":"R. Bloem","year":"2009","unstructured":"Bloem, R., Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.\u00a05643, pp. 140\u2013156. Springer, Heidelberg (2009)"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Bohy, A., Bruy\u00e8re, V., Filiot, E., Raskin, J.-F.: Synthesis from ltl specifications with mean-payoff objectives. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol.\u00a07795, pp. 169\u2013184. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-36742-7_12"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Boker, U., Chatterjee, K., Henzinger, T.A., Kupferman, O.: Temporal specifications with accumulative values. In: LICS, pp. 43\u201352 (2011)","DOI":"10.1109\/LICS.2011.33"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-31424-7_8","volume-title":"Computer Aided Verification","author":"T. Br\u00e1zdil","year":"2012","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Ku\u010dera, A., Novotn\u00fd, P.: Efficient controller synthesis for consumption games with multiple resource types. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol.\u00a07358, pp. 23\u201338. Springer, Heidelberg (2012)"},{"issue":"2","key":"35_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10703-010-0105-x","volume":"38","author":"L. Brim","year":"2011","unstructured":"Brim, L., Chaloupka, J., Doyen, L., Gentilini, R., Raskin, J.-F.: Faster algorithms for mean-payoff games. Formal Methods in System Design\u00a038(2), 97\u2013118 (2011)","journal-title":"Formal Methods in System Design"},{"key":"35_CR8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","volume":"138","author":"J.R. B\u00fcchi","year":"1969","unstructured":"B\u00fcchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Transactions of the AMS\u00a0138, 295\u2013311 (1969)","journal-title":"Transactions of the AMS"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. ACM ToCL (2010)","DOI":"10.1145\/1805950.1805953"},{"key":"35_CR10","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Generalized mean-payoff and energy games. In: FSTTCS, pp. 505\u2013516 (2010)"},{"key":"35_CR11","unstructured":"Chatterjee, K., Velner, Y.: Finite-state and pushdown games with multi-dimensional mean-payoff objectives. CoRR, abs\/1210.3141 (2012)"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Velner, Y.: Mean-payoff pushdown games. In: LICS (2012)","DOI":"10.1109\/LICS.2012.30"},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-642-15155-2_47","volume-title":"Mathematical Foundations of Computer Science 2010","author":"M. Droste","year":"2010","unstructured":"Droste, M., Meinecke, I.: Describing average- and longtime-behavior by weighted MSO logics. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 537\u2013548. Springer, Heidelberg (2010)"},{"key":"35_CR14","first-page":"109","volume":"8","author":"A. Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. IJGT\u00a08, 109\u2013113 (1979)","journal-title":"IJGT"},{"key":"35_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01442864","volume":"6","author":"P. Gordan","year":"1873","unstructured":"Gordan, P.: Ueber die auflosung linearer gleichungen mit reellen coeffizienten. Mathematische Annalen\u00a06, 23\u201328 (1873)","journal-title":"Mathematische Annalen"},{"issue":"2","key":"35_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica\u00a01(2), 169\u2013197 (1981)","journal-title":"Combinatorica"},{"issue":"5","key":"35_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0041-5553(88)90012-2","volume":"28","author":"V.A. Gurvich","year":"1990","unstructured":"Gurvich, V.A., Karzanov, A.V., Khachiyan, L.G.: Cyclic games and an algorithm to find minimax cycle means in directed graphs. USSR Comp. Math. Phys.\u00a028(5), 85\u201391 (1990)","journal-title":"USSR Comp. Math. Phys."},{"key":"35_CR18","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/0022-0000(81)90039-8","volume":"22","author":"N. Immerman","year":"1981","unstructured":"Immerman, N.: Number of quantifiers is better than number of tape cells. Journal of Computer and System Sciences\u00a022, 384\u2013406 (1981)","journal-title":"Journal of Computer and System Sciences"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Jurdzinski, M.: Deciding the winner in parity games is in UP \u2229 co-UP. IPL\u00a068 (1998)","DOI":"10.1016\/S0020-0190(98)00150-1"},{"key":"35_CR20","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","volume":"23","author":"R.M. Karp","year":"1978","unstructured":"Karp, R.M.: A characterization of the minimum cycle mean in a digraph. Discrete Mathematics\u00a023, 309\u2013311 (1978)","journal-title":"Discrete Mathematics"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R., Sullivan, G.F.: Detecting cycles in dynamic graphs in polynomial time. In: STOC, pp. 398\u2013406 (1988)","DOI":"10.1145\/62212.62251"},{"key":"35_CR22","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"C.H. Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.H.: On the complexity of integer programming. JACM\u00a028, 765\u2013768 (1981)","journal-title":"JACM"},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL, pp. 179\u2013190. ACM Press (1989)","DOI":"10.1145\/75277.75293"},{"issue":"1","key":"35_CR24","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1137\/0325013","volume":"25","author":"P.J. Ramadge","year":"1987","unstructured":"Ramadge, P.J., Wonham, W.M.: Supervisory control of a class of discrete-event processes. SIAM Journal of Control and Optimization\u00a025(1), 206\u2013230 (1987)","journal-title":"SIAM Journal of Control and Optimization"},{"key":"35_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-19805-2_19","volume-title":"Foundations of Software Science and Computational Structures","author":"Y. Velner","year":"2011","unstructured":"Velner, Y., Rabinovich, A.: Church synthesis problem for noisy input. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 275\u2013289. Springer, Heidelberg (2011)"},{"issue":"2","key":"35_CR26","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"I. Walukiewicz","year":"2001","unstructured":"Walukiewicz, I.: Pushdown processes: Games and model-checking. Inf. Comput.\u00a0164(2), 234\u2013263 (2001)","journal-title":"Inf. Comput."},{"key":"35_CR27","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. Theoretical Computer Science\u00a0158, 343\u2013359 (1996)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2013 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40184-8_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T03:41:24Z","timestamp":1563507684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40184-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401831","9783642401848"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40184-8_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}