{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:09:49Z","timestamp":1775282989255,"version":"3.50.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030017125","type":"print"},{"value":"9783030017132","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-01713-2_12","type":"book-chapter","created":{"date-parts":[[2018,11,23]],"date-time":"2018-11-23T14:22:06Z","timestamp":1542982926000},"page":"163-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reasoning About Additional Winning Strategies in Two-Player Games"],"prefix":"10.1007","author":[{"given":"Vadim","family":"Malvone","sequence":"first","affiliation":[]},{"given":"Aniello","family":"Murano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,14]]},"reference":[{"issue":"5","key":"12_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., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5), 672\u2013713 (2002)","journal-title":"J. ACM"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4204\/EPTCS.218.1","volume":"218","author":"Benjamin Aminof","year":"2016","unstructured":"Aminof, B., Malvone, V., Murano, A., Rubin, S.: Extended graded modalities in strategy logic. In: SR 2016, pp. 1\u201314 (2016)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Aminof, B., Malvone, V., Murano, A., Rubin, S.: Graded strategy logic: reasoning about uniqueness of nash equilibria. In: AAMAS 2016, pp. 698\u2013706 (2016)","DOI":"10.65109\/XWSC7028"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-662-48899-7_20","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"Benjamin Aminof","year":"2015","unstructured":"Aminof, B., Murano, A., Rubin, S.: On ctl* with graded path modalities. In: LPAR-20, pp. 281\u2013296 (2015)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-319-26350-2_3","volume-title":"AI 2015: Advances in Artificial Intelligence","author":"F Baader","year":"2015","unstructured":"Baader, F., Borgwardt, S., Lippmann, M.: Temporal conjunctive queries in expressive description logics with transitive roles. In: Pfahringer, B., Renz, J. (eds.) AI 2015. LNCS (LNAI), vol. 9457, pp. 21\u201333. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26350-2_3"},{"issue":"3","key":"12_CR6","first-page":"25:1","volume":"13","author":"A Bianco","year":"2012","unstructured":"Bianco, A., Mogavero, F., Murano, A.: Graded computation tree logic. Trans. Comput. Log. 13(3), 25:1\u201325:53 (2012)","journal-title":"Trans. Comput. Log."},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-4(3:11)2008","volume":"4","author":"P Bonatti","year":"2008","unstructured":"Bonatti, P., Lutz, C., Murano, A., Vardi, M.: The complexity of enriched mucalculi. Log. Methods Comput. Sci. 4(3), 1\u201327 (2008)","journal-title":"Log. Methods Comput. Sci."},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10703-010-0093-x","volume":"36","author":"L Bozzelli","year":"2010","unstructured":"Bozzelli, L., Murano, A., Peron, A.: Pushdown module checking. Form. Methods Syst. Des. 36(1), 65\u201395 (2010)","journal-title":"Form. Methods Syst. Des."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, M.: An O(n $${}^{\\text{2}}$$ ) time algorithm for alternating b\u00fcchi games. In: SODA 2012, pp. 1386\u20131399 (2012)","DOI":"10.1137\/1.9781611973099.109"},{"key":"12_CR10","series-title":"Springer Series in Operations Research and Financial Engineering","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-9149-1","volume-title":"The Logic of Logistics: Theory, Algorithms, and Applications for Logistics Management","author":"D Simchi-Levi","year":"2014","unstructured":"Simchi-Levi, D., Chen, X., Bramel, J.: The Logic of Logistics: Theory, Algorithms, and Applications for Logistics Management. SSORFE. Springer, New York (2014). https:\/\/doi.org\/10.1007\/978-1-4614-9149-1"},{"issue":"3","key":"12_CR11","first-page":"1","volume":"4","author":"A Ferrante","year":"2008","unstructured":"Ferrante, A., Murano, A., Parente, M.: Enriched mu-calculi module checking. Log. Methods Comput. Sci. 4(3), 1\u201321 (2008)","journal-title":"Log. Methods Comput. Sci."},{"issue":"3","key":"12_CR12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.3233\/FI-2009-181","volume":"96","author":"A Ferrante","year":"2009","unstructured":"Ferrante, A., Napoli, M., Parente, M.: Model checking for graded CTL. Fundam. Inf. 96(3), 323\u2013339 (2009)","journal-title":"Fundam. Inf."},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/0047-2727(92)90076-R","volume":"49","author":"CD Fraser","year":"1992","unstructured":"Fraser, C.D.: The uniqueness of nash equilibrium in the private provision of public goods: an alternative proof. J. Publ. Econ. 49(3), 389\u2013390 (1992)","journal-title":"J. Publ. Econ."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Gutierrez, J., Perelli, G., Wooldridge, M.: Iterated games with LDL goals over finite traces. In: AAMAS 2017, pp. 696\u2013704 (2017)","DOI":"10.65109\/KOBV1679"},{"key":"12_CR15","series-title":"NATO ASI Series (Series F: Computer and Systems Sciences)","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-82453-1_17","volume-title":"Logics and Models of Concurrent Systems","author":"D Harel","year":"1985","unstructured":"Harel, D., Pnueli, A.: On the development of reactive systems. In: Apt, K.R. (ed.) Logics and Models of Concurrent Systems. NATO ASI Series (Series F: Computer and Systems Sciences), vol. 13. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/978-3-642-82453-1_17"},{"issue":"3","key":"12_CR16","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. J. Comput. Syst. Sci. 22(3), 384\u2013406 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Jamroga, W., Murano, A.: On module checking and strategies. In: AAMAS 2014, pp. 701\u2013708 (2014)","DOI":"10.65109\/EKGC9725"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Jamroga, W., Murano, A.: Module checking of strategic ability. In: AAMAS 2015, pp. 227\u2013235 (2015)","DOI":"10.65109\/SMMX2715"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/3-540-45620-1_34","volume-title":"Automated Deduction\u2014CADE-18","author":"O Kupferman","year":"2002","unstructured":"Kupferman, O., Sattler, U., Vardi, M.Y.: The complexity of the graded mu-calculus. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 423\u2013437. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45620-1_34"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-63166-6_7","volume-title":"Computer Aided Verification","author":"O Kupferman","year":"1997","unstructured":"Kupferman, O., Vardi, M.Y.: Module checking revisited. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 36\u201347. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63166-6_7"},{"issue":"2","key":"12_CR21","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1145\/333979.333987","volume":"47","author":"O Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M., Wolper, P.: An automata theoretic approach to branching-time model checking. J. ACM 47(2), 312\u2013360 (2000)","journal-title":"J. ACM"},{"issue":"2","key":"12_CR22","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1006\/inco.2000.2893","volume":"164","author":"O Kupferman","year":"2001","unstructured":"Kupferman, O., Vardi, M., Wolper, P.: Module checking. Inf. Comput. 164(2), 322\u2013344 (2001)","journal-title":"Inf. Comput."},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Malvone, V., Mogavero, F., Murano, A., Sorrentino, L.: Reasoning about graded strategy quantifiers. Inf. Comput. (to appear)","DOI":"10.1016\/j.ic.2017.08.010"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Malvone, V., Mogavero, F., Murano, A., Sorrentino, L.: On the counting of strategies. In: TIME 2015, pp. 170\u2013179 (2015)","DOI":"10.1109\/TIME.2015.19"},{"key":"12_CR25","unstructured":"Malvone, V., Murano, A.: Additional winning strategies in two-player games. In: ICTCS 2016, pp. 251\u2013256 (2016)"},{"key":"12_CR26","unstructured":"Malvone, V., Murano, A., Sorrentino, L.: Games with additional winning strategies. In: CILC 2015, pp. 175\u2013180 (2015)"},{"issue":"4","key":"12_CR27","doi-asserted-by":"publisher","first-page":"34:1","DOI":"10.1145\/2631917","volume":"15","author":"F Mogavero","year":"2014","unstructured":"Mogavero, F., Murano, A., Perelli, G., Vardi, M.: Reasoning about strategies: on the model-checking problem. TOCL 15(4), 34:1\u201334:42 (2014)","journal-title":"TOCL"},{"key":"12_CR28","unstructured":"Murano, A., Perelli, G.: Pushdown multi-agent system verification. In: IJCAI 2015, pp. 1090\u20131097 (2015)"},{"key":"12_CR29","unstructured":"Murano, A., Sorrentino, L.: A game-based model for human-robots interaction. In: WOA 2015, pp. 146\u2013150 (2015)"},{"issue":"2","key":"12_CR30","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF00933234","volume":"27","author":"G Papavassilopoulos","year":"1979","unstructured":"Papavassilopoulos, G., Cruz, J.B.: On the uniqueness of nash strategies for a class of analytic differential games. JOTA 27(2), 309\u2013314 (1979)","journal-title":"JOTA"},{"key":"12_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-8322-1","volume-title":"Game Theory for Control of Optical Networks","author":"L Pavel","year":"2012","unstructured":"Pavel, L.: Game Theory for Control of Optical Networks. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-0-8176-8322-1"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Infinite trees and automaton definable relations over omega-words. In: STACS 1990, pp. 263\u2013277 (1990)","DOI":"10.1007\/3-540-52282-4_49"},{"key":"12_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0015261","volume-title":"Computer Science Today","author":"MY Vardi","year":"1995","unstructured":"Vardi, M.Y.: Alternating automata and program verification. In: van Leeuwen, J. (ed.) Computer Science Today. Lecture Notes in Computer Science, vol. 1000. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0015261"},{"key":"12_CR34","volume-title":"An Introduction to Multi Agent Systems","author":"M Wooldridge","year":"2002","unstructured":"Wooldridge, M.: An Introduction to Multi Agent Systems. Wiley, Hoboken (2002)"},{"key":"12_CR35","doi-asserted-by":"crossref","DOI":"10.1201\/b10975","volume-title":"Game Theory for Wireless Communications and Networking","author":"Y Zhang","year":"2011","unstructured":"Zhang, Y., Guizani, M.: Game Theory for Wireless Communications and Networking. CRC Press, Boca Raton (2011)"}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems and Agreement Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01713-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:30:20Z","timestamp":1775280620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01713-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030017125","9783030017132"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01713-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}