{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:05:10Z","timestamp":1742911510949,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030317836"},{"type":"electronic","value":"9783030317843"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-31784-3_1","type":"book-chapter","created":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T21:32:04Z","timestamp":1571607124000},"page":"3-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Note on Game Theory and Verification"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,21]]},"reference":[{"key":"1_CR1","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 49, 672\u2013713 (2002)","journal-title":"J. ACM"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-319-89366-2_29","volume-title":"Foundations of Software Science and Computation Structures","author":"P Bouyer","year":"2018","unstructured":"Bouyer, P.: Games on graphs with a public signal monitoring. In: Baier, C., Dal Lago, U. (eds.) FoSSaCS 2018. LNCS, vol. 10803, pp. 530\u2013547. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-89366-2_29"},{"key":"1_CR3","unstructured":"Bouyer, P., Brenguier, R., Markey, N., Ummels, M.: Nash equilibria in concurrent games with B\u00fcchi objectives. In: Proceedings of the 30th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). LIPIcs, vol. 13, pp. 375\u2013386. Leibniz-Zentrum f\u00fcr Informatik (2011)"},{"issue":"2","key":"1_CR4","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2168\/LMCS-11(2:9)2015","volume":"11","author":"P Bouyer","year":"2015","unstructured":"Bouyer, P., Brenguier, R., Markey, N., Ummels, M.: Pure Nash equilibria in concurrent games. Logical Methods Comput. Sci. 11(2), 9 (2015)","journal-title":"Logical Methods Comput. Sci."},{"key":"1_CR5","unstructured":"Bouyer, P., Markey, N., Stan, D.: Mixed Nash equilibria in concurrent games. In: Proceedings of the 33rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2014). LIPIcs, vol. 29, pp. 351\u2013363. Leibniz-Zentrum f\u00fcr Informatik (2014)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.4204\/EPTCS.226.5","volume":"226","author":"Patricia Bouyer","year":"2016","unstructured":"Bouyer, P., Markey, N., Stan, D.: Stochastic equilibria under imprecise deviations in terminal-reward concurrent games. In: Proceedings of the 7th International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2016). Electronic Proceedings in Theoretical Computer Science, vol. 226, pp. 61\u201375 (2016)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"1_CR7","unstructured":"Bouyer, P., Thomasset, N.: Nash equilibria in games over graphs equipped with a communication mechanism. In: Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). LIPIcs, vol. 138. Leibniz-Zentrum f\u00fcr Informatik (2019, to appear)"},{"key":"1_CR8","unstructured":"Brenguier, R.: Nash equilibria in concurrent games - application to timed games. Ph.D. thesis, ENS Cachan, France (2012)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-662-49630-5_13","volume-title":"Foundations of Software Science and Computation Structures","author":"R Brenguier","year":"2016","unstructured":"Brenguier, R.: Robust equilibria in mean-payoff games. In: Jacobs, B., L\u00f6ding, C. (eds.) FoSSaCS 2016. LNCS, vol. 9634, pp. 217\u2013233. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49630-5_13"},{"key":"1_CR10","unstructured":"Brenguier, R., Pauly, A., Raskin, J.-F., Sankur, O.: Admissibility in games with imperfect information (invited talk). In: Proceedings of the 28th International Conference on Concurrency Theory (CONCUR 2017). LIPIcs, vol. 85, pp. 2:1\u20132:23. Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"1_CR11","unstructured":"Brihaye, T., Bruy\u00e8re, V., Goeminne, A., Raskin, J.-F. Constrained existence problem for weak subgame perfect equilibria with $$\\omega $$-regular boolean objectives. In: Proceedings of the 9th International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2018). Electronic Proceedings in Theoretical Computer Science, vol. 277, pp. 16\u201329 (2018)"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-9(1:7)2013","volume":"9","author":"T Brihaye","year":"2013","unstructured":"Brihaye, T., Bruy\u00e8re, V., De Pril, J., Gimbert, H.: On subgame perfection in quantitative reachability games. Logical Methods Comput. Sci. 9(1), 1\u201332 (2013)","journal-title":"Logical Methods Comput. Sci."},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-662-54458-7_9","volume-title":"Foundations of Software Science and Computation Structures","author":"V Bruy\u00e8re","year":"2017","unstructured":"Bruy\u00e8re, V., Le Roux, S., Pauly, A., Raskin, J.-F.: On the existence of weak subgame perfect equilibria. In: Esparza, J., Murawski, A.S. (eds.) FoSSaCS 2017. LNCS, vol. 10203, pp. 145\u2013161. Springer, Heidelberg (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-662-54458-7_9"},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/2579821","volume":"15","author":"K Chatterjee","year":"2014","unstructured":"Chatterjee, K., Doyen, L.: Partial-observation stochastic games: how to win when belief fails. ACM Trans. Comput. Log. 15(2), 16 (2014)","journal-title":"ACM Trans. Comput. Log."},{"issue":"1\u20132","key":"1_CR15","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2006.07.032","volume":"365","author":"K Chatterjee","year":"2006","unstructured":"Chatterjee, K., Henzinger, T.A., Jurdzi\u0144ski, M.: Games with secure equilibria. Theor. Comput. Sci. 365(1\u20132), 67\u201382 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-30124-0_6","volume-title":"Computer Science Logic","author":"K Chatterjee","year":"2004","unstructured":"Chatterjee, K., Majumdar, R., Jurdzi\u0144ski, M.: On Nash equilibria in stochastic games. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 26\u201340. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30124-0_6"},{"key":"1_CR17","unstructured":"Condurache, R., Oualhadj, Y., Troquard, N. The complexity of rational synthesis for concurrent games. In: Proceedings of the 29th International Conference on Concurrency Theory (CONCUR 2018), LIPIcs, pp. 38:1\u201338:15. Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1016\/j.geb.2008.02.015","volume":"63","author":"V Conitzer","year":"2008","unstructured":"Conitzer, V., Sandholm, T.: New complexity results about Nash equilibria. Games Econ. Behav. 63(2), 621\u2013641 (2008)","journal-title":"Games Econ. Behav."},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Gimbert, H., Horn, F.: Solving simple stochastic tail games. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 847\u2013862. SIAM (2010)","DOI":"10.1137\/1.9781611973075.69"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata, Logics, and Infinite Games: A Guide to Current Research","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games: A Guide to Current Research. LNCS, vol. 2500. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-36387-4"},{"key":"1_CR21","unstructured":"Gr\u00e4del, E., Ummels, M.: Solution concepts and algorithms for infinite multiplayer games. In: New Perspectives on Games and Interaction. Texts in Logic and Games, vol. 4, pp. 151\u2013178. Amsterdam University Press (2008)"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"83","DOI":"10.4204\/EPTCS.305.6","volume":"305","author":"Kristoffer Arnsfelt Hansen","year":"2019","unstructured":"Hansen, K.A., Raskin, M.: A stay-in-a-set game without a stationary equilibrium. In: Proceedings of the 10th International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2019) (2019, to appear)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"1_CR23","unstructured":"Henzinger, T.A.: Games in system design and verification. In: Proceedings of the 10th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2005), pp. 1\u20134 (2005)"},{"key":"1_CR24","unstructured":"Markey, N.: Temporal logics for multi-agent systems (invited talk). In: Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). LIPIcs, vol. 83, pp. 84:1\u201384:3. Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"1_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794216","volume-title":"Game Theory","author":"M Maschler","year":"2013","unstructured":"Maschler, M., Solan, E., Zamir, S.: Game Theory. Cambridge University Press, Cambridge (2013)"},{"issue":"1","key":"1_CR26","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"JF Nash","year":"1950","unstructured":"Nash, J.F.: Equilibrium points in $$n$$-person games. Proc. Natl. Acad. Sci. U. S. A. 36(1), 48\u201349 (1950)","journal-title":"Proc. Natl. Acad. Sci. U. S. A."},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th Annual Symposium on Foundations of Computer Science (FOCS 1977), pp. 46\u201357. IEEE Computer Society Press (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s001820200092","volume":"30","author":"P Secchi","year":"2001","unstructured":"Secchi, P., Sudderth, W.D.: Stay-in-a-set games. Int. J. Game Theory 30, 479\u2013490 (2001)","journal-title":"Int. J. Game Theory"},{"key":"1_CR29","unstructured":"Stan, D.: Randomized strategies in concurrent games. Ph.D. thesis, Universit\u00e9 Paris-Saclay, France (2017)"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-45657-0_5","volume-title":"Computer Aided Verification","author":"W Thomas","year":"2002","unstructured":"Thomas, W.: Infinite games and verification. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 58\u201365. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-45657-0_5"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/11944836_21","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"M Ummels","year":"2006","unstructured":"Ummels, M.: Rational behaviour and strategy construction in infinite multiplayer games. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 212\u2013223. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11944836_21"},{"key":"1_CR32","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. (ed.) FoSSaCS 2008. LNCS, vol. 4962, pp. 20\u201334. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-78499-9_3"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Ummels, M.: Stochastic multiplayer games - theory and algorithms. Ph.D. thesis, RWTH Aachen, Germany (2010)","DOI":"10.5117\/9789085550402"},{"key":"1_CR34","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-23217-6_32"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Ummels, M., Wojtczak, D.: The complexity of Nash equilibria in stochastic multiplayer games. Logical Methods Comput. Sci. 7(3) (2011)","DOI":"10.2168\/LMCS-7(3:20)2011"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31784-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T13:28:04Z","timestamp":1573738084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31784-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030317836","9783030317843"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31784-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/atva2019.iis.sinica.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"87","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Between 1 and 2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}