{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T09:45:33Z","timestamp":1770111933816,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662496299","type":"print"},{"value":"9783662496305","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49630-5_13","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T05:04:32Z","timestamp":1458536672000},"page":"217-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Robust Equilibria in Mean-Payoff Games"],"prefix":"10.1007","author":[{"given":"Romain","family":"Brenguier","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Gonen, R., Halpern, J.: Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, pp. 53\u201362. ACM (2006)","DOI":"10.1145\/1146381.1146393"},{"issue":"5","key":"13_CR2","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM (JACM) 49(5), 672\u2013713 (2002)","journal-title":"J. ACM (JACM)"},{"key":"13_CR3","first-page":"287","volume":"23","author":"R Aumann","year":"1959","unstructured":"Aumann, R.: Acceptable points in general cooperative n-person games. Top. Math. Econ. Game Theory Essays Honor Robert J Aumann 23, 287\u2013324 (1959)","journal-title":"Top. Math. Econ. Game Theory Essays Honor Robert J Aumann"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-28729-9_20","volume-title":"Foundations of Software Science and Computational Structures","author":"P Bouyer","year":"2012","unstructured":"Bouyer, P., Brenguier, R., Markey, N., Ummels, M.: Concurrent games with ordered objectives. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol. 7213, pp. 301\u2013315. Springer, Heidelberg (2012)"},{"key":"13_CR5","unstructured":"Bouyer, P., Markey, N., Stan, D.: Mixed nash equilibria in concurrent terminal-reward games. In: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 29, pp. 351\u2013363 (2014)"},{"key":"13_CR6","unstructured":"Brenguier, R.: Nash equilibria in concurrent games: application to timed games. Ph.D. thesis, Cachan, Ecole normale sup\u00e9rieure (2012)"},{"key":"13_CR7","unstructured":"Brenguier, R.: Robust equilibria in concurrent games. CoRR, \n                      http:\/\/arxiv.org\/abs\/1311.7683\n                      \n                     (2015)"},{"key":"13_CR8","unstructured":"Brenguier, R., Raskin, J.-F.: Optimal values of multidimensional mean-payoff games (2014). \n                      https:\/\/hal.archives-ouvertes.fr\/hal-00977352\/"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-21668-3_15","volume-title":"Computer Aided Verification","author":"R Brenguier","year":"2015","unstructured":"Brenguier, R., Raskin, J.-F.: Pareto curves of multidimensional mean-payoff games. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9207, pp. 251\u2013267. Springer, Heidelberg (2015)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-13182-0_7","volume-title":"Computer Science \u2013 Theory and Applications","author":"T Brihaye","year":"2010","unstructured":"Brihaye, T., Bruy\u00e8re, V., De Pril, J.: Equilibria in quantitative reachability games. In: Ablayev, F., Mayr, E.W. (eds.) CSR 2010. LNCS, vol. 6072, pp. 72\u201383. Springer, Heidelberg (2010)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Canny, J.: Some algebraic and geometric computations in pspace. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 460\u2013467. ACM (1988)","DOI":"10.1145\/62212.62257"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/11561163_7","volume-title":"Formal Methods for Components and Objects","author":"K Chatterjee","year":"2005","unstructured":"Chatterjee, K., Henzinger, T.A., Jurdzi\u0144ski, M.: Games with Secure Equilibria\n                      \n                        \n                      \n                      $$^{,}$$\n                      \n                        \n                          \n                            \n                            ,\n                          \n                        \n                      \n                    . In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2004. LNCS, vol. 3657, pp. 141\u2013161. Springer, Heidelberg (2005)"},{"issue":"6","key":"13_CR13","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.ic.2009.07.004","volume":"208","author":"K Chatterjee","year":"2010","unstructured":"Chatterjee, K., Henzinger, T.A., Piterman, N.: Strategy logic. Inform. Comput. 208(6), 677\u2013693 (2010)","journal-title":"Inform. Comput."},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-32940-1_15","volume-title":"Concur 2012 \u2013 Concurrency Theory","author":"F Mogavero","year":"2012","unstructured":"Mogavero, F., Murano, A., Perelli, G., Vardi, M.Y.: What makes Atl* decidable? A decidable fragment of strategy logic. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 193\u2013208. Springer, Heidelberg (2012)"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"JF Nash Jr","year":"1950","unstructured":"Nash Jr., J.F.: Equilibrium points in \n                      \n                        \n                      \n                      $$n$$\n                      \n                        \n                          n\n                        \n                      \n                    -person games. Proc. Nat. Acad. Sci. USA 36(1), 48\u201349 (1950)","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Puterman, M.L.: Markov decision processes: Discrete stochastic dynamic programming (1994)","DOI":"10.1002\/9780470316887"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-78499-9_3","volume-title":"Foundations of Software Science and Computational Structures","author":"M Ummels","year":"2008","unstructured":"Ummels, M.: The complexity of nash equilibria in infinite multiplayer games. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 20\u201334. Springer, Heidelberg (2008)"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-02930-1_25","volume-title":"Automata, Languages and Programming","author":"M Ummels","year":"2009","unstructured":"Ummels, M., Wojtczak, D.: The complexity of nash equilibria in simple stochastic multiplayer games. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 297\u2013308. Springer, Heidelberg (2009)"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-642-23217-6_32","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"M Ummels","year":"2011","unstructured":"Ummels, M., Wojtczak, D.: The Complexity of Nash Equilibria in Limit-Average Games. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 482\u2013496. Springer, Heidelberg (2011)"},{"key":"13_CR20","unstructured":"Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T.A., Rabinovich, A., Raskin, J.-F.: The complexity of multi-mean-payoff and multi-energy games. CoRR abs\/1209.3234 (2012)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49630-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T21:07:32Z","timestamp":1584997652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49630-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496299","9783662496305"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49630-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}