{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:04Z","timestamp":1760202664449,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T00:00:00Z","timestamp":1405296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["279499: inVEST"],"award-info":[{"award-number":["279499: inVEST"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["FP7-ICT-601148"],"award-info":[{"award-number":["FP7-ICT-601148"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002661","name":"Fonds De La Recherche Scientifique - FNRS","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,14]]},"DOI":"10.1145\/2603088.2603109","type":"proceedings-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T13:21:45Z","timestamp":1406553705000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Secure equilibria in weighted games"],"prefix":"10.1145","author":[{"given":"V\u00e9ronique","family":"Bruy\u00e8re","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Mons (UMONS), Belgium"}]},{"given":"No\u00e9mie","family":"Meunier","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Mons (UMONS), Belgium"}]},{"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Libre de Bruxelles (U.L.B.), Belgium"}]}],"member":"320","published-online":{"date-parts":[[2014,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00427-4"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_14"},{"key":"e_1_3_2_1_3_1","volume-title":"personal communication","author":"Boker U.","year":"2014","unstructured":"U. Boker and J. Otop . personal communication , 2014 . U. Boker and J. Otop. personal communication, 2014."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13182-0_7"},{"key":"e_1_3_2_1_5_1","volume-title":"On subgame perfection in quantitative reachability games. Logical Methods in Computer Science, 9","author":"Brihaye T.","year":"2012","unstructured":"T. Brihaye , V. Bruy\u00e8re , J. De Pril , and H. Gimbert . On subgame perfection in quantitative reachability games. Logical Methods in Computer Science, 9 , 2012 . T. Brihaye, V. Bruy\u00e8re, J. De Pril, and H. Gimbert. On subgame perfection in quantitative reachability games. Logical Methods in Computer Science, 9, 2012."},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","first-page":"59","volume-title":"LFCS","author":"Brihaye T.","year":"2013","unstructured":"T. Brihaye , J. De Pril , and S. Schewe . Multiplayer cost games with simple Nash equilibria . In LFCS , volume 7734 of LNCS , pages 59 -- 73 . Springer , 2013 . T. Brihaye, J. De Pril, and S. Schewe. Multiplayer cost games with simple Nash equilibria. In LFCS, volume 7734 of LNCS, pages 59--73. Springer, 2013."},{"key":"e_1_3_2_1_7_1","volume-title":"Secure equilibria in weighted games. CoRR, abs\/1402.3962","author":"Bruy\u00e8re V.","year":"2014","unstructured":"V. Bruy\u00e8re , N. Meunier , and J.-F. Raskin . Secure equilibria in weighted games. CoRR, abs\/1402.3962 , 2014 . V. Bruy\u00e8re, N. Meunier, and J.-F. Raskin. Secure equilibria in weighted games. CoRR, abs\/1402.3962, 2014."},{"key":"e_1_3_2_1_8_1","series-title":"LNCS","first-page":"261","volume-title":"TACAS","author":"Chatterjee K.","year":"2007","unstructured":"K. Chatterjee and T. A. Henzinger . Assume-guarantee synthesis . In TACAS , volume 4424 of LNCS , pages 261 -- 275 . Springer , 2007 . K. Chatterjee and T. A. Henzinger. Assume-guarantee synthesis. In TACAS, volume 4424 of LNCS, pages 261--275. Springer, 2007."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.07.032"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1805950.1805953"},{"key":"e_1_3_2_1_11_1","series-title":"LNCS","first-page":"228","volume-title":"LPAR","author":"Chatterjee K.","year":"2013","unstructured":"K. Chatterjee , V. Forejt , and D. Wojtczak . Multi-objective discounted reward verification in graphs and mdps . In LPAR , volume 8312 of LNCS , pages 228 -- 242 , 2013 . K. Chatterjee, V. Forejt, and D. Wojtczak. Multi-objective discounted reward verification in graphs and mdps. In LPAR, volume 8312 of LNCS, pages 228--242, 2013."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01768705"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185392"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12002-2_16"},{"key":"e_1_3_2_1_16_1","series-title":"LNCS","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata, Logics, and Infinite Games: A Guide to Current Research","author":"Gr\u00e4del E.","year":"2002","unstructured":"E. Gr\u00e4del , W. Thomas , and T. Wilke , editors . Automata, Logics, and Infinite Games: A Guide to Current Research , volume 2500 of LNCS , 2002 . Springer . ISBN 3-540-00388-6. E. Gr\u00e4del, W. Thomas, and T. Wilke, editors. Automata, Logics, and Infinite Games: A Guide to Current Research, volume 2500 of LNCS, 2002. Springer. ISBN 3-540-00388-6."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28332-1_31"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.2307\/1971035"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.36.1.48"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75293"},{"key":"e_1_3_2_1_21_1","volume-title":"Existence of secure equilibrium in multi-player games with perfect information. CoRR, abs\/1405.1615","author":"Pril J. D.","year":"2014","unstructured":"J. D. Pril , J. Flesch , J. Kuipers , G. Schoenmakers , and K. Vrieze . Existence of secure equilibrium in multi-player games with perfect information. CoRR, abs\/1405.1615 , 2014 . J. D. Pril, J. Flesch, J. Kuipers, G. Schoenmakers, and K. Vrieze. Existence of secure equilibrium in multi-player games with perfect information. CoRR, abs\/1405.1615, 2014."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0325013"},{"key":"e_1_3_2_1_23_1","series-title":"LNCS","first-page":"482","volume-title":"CONCUR","author":"Ummels M.","year":"2011","unstructured":"M. Ummels and D. Wojtczak . The complexity of Nash equilibria in limit-average games . In CONCUR , volume 6901 of LNCS , pages 482 -- 496 . Springer , 2011 . M. Ummels and D. Wojtczak. The complexity of Nash equilibria in limit-average games. In CONCUR, volume 6901 of LNCS, pages 482--496. Springer, 2011."},{"key":"e_1_3_2_1_24_1","volume-title":"The complexity of multi-mean-payoff and multi-energy games. CoRR, abs\/1209.3234","author":"Velner Y.","year":"2012","unstructured":"Y. Velner , K. Chatterjee , L. Doyen , T. A. Henzinger , A. Rabinovich , and J.-F. Raskin . The complexity of multi-mean-payoff and multi-energy games. CoRR, abs\/1209.3234 , 2012 . Y. Velner, K. Chatterjee, L. Doyen, T. A. Henzinger, A. Rabinovich, and J.-F. Raskin. The complexity of multi-mean-payoff and multi-energy games. CoRR, abs\/1209.3234, 2012."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00188-3"}],"event":{"name":"CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vienna Austria","acronym":"CSL-LICS '14"},"container-title":["Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603109","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2603088.2603109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:34Z","timestamp":1750278154000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,14]]},"references-count":24,"alternative-id":["10.1145\/2603088.2603109","10.1145\/2603088"],"URL":"https:\/\/doi.org\/10.1145\/2603088.2603109","relation":{},"subject":[],"published":{"date-parts":[[2014,7,14]]},"assertion":[{"value":"2014-07-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}