乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T02:21:23Z","timestamp":1691029283075},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T00:00:00Z","timestamp":1636416000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T00:00:00Z","timestamp":1636416000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"publisher","award":["2015-04388"],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009244","name":"Stockholm University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100009244","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2022,4]]},"abstract":"Abstract<\/jats:title>We propose a general framework for modelling and formal reasoning about multi-agent systems and, in particular, multi-stage games where both quantitative<\/jats:italic> and qualitative<\/jats:italic> objectives and constraints are involved. Our models enrich concurrent game models with payoffs and guards on actions associated with each state of the model and propose a quantitative extension of the logic

$${\\textsf {ATL}}^{*}$$<\/jats:tex-math>\n \n \n ATL<\/mml:mi>\n <\/mml:mrow>\n \n \n \u2217<\/mml:mo>\n <\/mml:mrow>\n <\/mml:msup>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> that enables the combination of quantitative and qualitative reasoning. We illustrate the framework with some detailed examples. Finally, we consider the model-checking problems arising in our framework and establish some general undecidability and decidability results for them.<\/jats:p>","DOI":"10.1007\/s10458-021-09531-9","type":"journal-article","created":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T06:08:56Z","timestamp":1636438136000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Combining quantitative and qualitative reasoning in concurrent multi-player games"],"prefix":"10.1007","volume":"36","author":[{"given":"Nils","family":"Bulling","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0157-1644","authenticated-orcid":false,"given":"Valentin","family":"Goranko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,9]]},"reference":[{"key":"9531_CR1","doi-asserted-by":"crossref","unstructured":"Alechina, N., Demri, S., & Logan, B. (2020). Parameterised resource-bounded ATL. In Proceedings of EAAI 2020, (pp. 7040\u20137046). AAAI Press.","DOI":"10.1609\/aaai.v34i05.6189"},{"key":"9531_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2018.01.019","volume":"750","author":"N Alechina","year":"2018","unstructured":"Alechina, N., Bulling, N., Demri, S., & Logan, B. (2018). On the complexity of resource-bounded logics. Theoretical Computer Science, 750, 69\u2013100. https:\/\/doi.org\/10.1016\/j.tcs.2018.01.019.","journal-title":"Theoretical Computer Science"},{"key":"9531_CR3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.artint.2016.12.005","volume":"245","author":"N Alechina","year":"2017","unstructured":"Alechina, N., Bulling, N., Logan, B., & Nguyen, H. N. (2017). The virtues of idleness: A decidable fragment of resource agent logic. Artificial Intelligence, 245, 56\u201385. https:\/\/doi.org\/10.1016\/j.artint.2016.12.005.","journal-title":"Artificial Intelligence"},{"issue":"6","key":"9531_CR4","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1093\/logcom\/exq032","volume":"21","author":"N Alechina","year":"2011","unstructured":"Alechina, N., Logan, B., Nga, N. H., & Rakib, A. (2011). Logic for coalitions with bounded resources. Journal of Logic and Computation, 21(6), 907\u2013937. https:\/\/doi.org\/10.1093\/logcom\/exq032.","journal-title":"Journal of Logic and Computation"},{"key":"9531_CR5","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.jcss.2017.03.008","volume":"88","author":"N Alechina","year":"2017","unstructured":"Alechina, N., Logan, B., Nguyen, H. N., & Raimondi, F. (2017). Model-checking for resource-bounded ATL with production and consumption of resources. Journal of Computer and System Sciences, 88, 126\u2013144. https:\/\/doi.org\/10.1016\/j.jcss.2017.03.008.","journal-title":"Journal of Computer and System Sciences"},{"key":"9531_CR6","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. (2002). Alternating-time Temporal Logic. Journal of the ACM, 49, 672\u2013713. https:\/\/doi.org\/10.1145\/585265.585270.","journal-title":"Journal of the ACM"},{"key":"9531_CR7","unstructured":"Belardinelli, F., & Demri, S. (2019). Resource-bounded ATL: the quest for tractable fragments. In: Elkind, E., Veloso, M., Agmon, N., & Taylor, M.E. (eds.) Proceedings of AAMAS 2019, (pp. 206\u2013214). International Foundation for Autonomous Agents and Multiagent Systems."},{"key":"9531_CR8","unstructured":"Belardinelli, F., & Demri, S. (2020). Reasoning with a bounded number of resources in ATL+. In Giacomo, G.D., Catal\u00e1, A., Dilkina, B., Milano, M., Barro, S., Bugar\u00edn, A., & Lang, J.(eds.) Proceedings of ECAI 2020, Frontiers in Artificial Intelligence and Applications, vol. 325, (pp. 624\u2013631). IOS Press."},{"key":"9531_CR9","doi-asserted-by":"crossref","unstructured":"B\u00e9rard, B., Haddad, S., Sassolas, M., & Sznajder, N. (2012). Concurrent games on VASS with inhibition. In: Koutny, M., & Ulidowski, I. (eds.) Proceedings of CONCUR 2012, Lecture Notes in Computer Science, (vol. 7454, pp. 39\u201352). Springer.","DOI":"10.1007\/978-3-642-32940-1_5"},{"issue":"1","key":"9531_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1214\/aoms\/1177698513","volume":"39","author":"D Blackwell","year":"1968","unstructured":"Blackwell, D., & Ferguson, T. S. (1968). The big match. The Annals of Mathematical Statistics, 39(1), 159\u2013163.","journal-title":"The Annals of Mathematical Statistics"},{"key":"9531_CR11","doi-asserted-by":"crossref","unstructured":"Blockelet, M., & Schmitz, S. (2011). Model checking coverability graphs of vector addition systems. In Proceedings of the 36th international conference on Mathematical foundations of computer science, MFCS\u201911, (pp. 108\u2013119). Springer-Verlag, Berlin, Heidelberg.","DOI":"10.1007\/978-3-642-22993-0_13"},{"key":"9531_CR12","doi-asserted-by":"publisher","unstructured":"Blondin, M., Finkel, A., G\u00f6ller, S., Haase, C., & McKenzie, P. (2015). Reachability in two-dimensional vector addition systems with states is pspace-complete. In Proceedings of LICS 2015, (pp. 32\u201343). IEEE Computer Society. https:\/\/doi.org\/10.1109\/LICS.2015.14.","DOI":"10.1109\/LICS.2015.14"},{"key":"9531_CR13","doi-asserted-by":"crossref","unstructured":"Bohy, A., Bruy\u00e8re, V., Filiot, E., & Raskin, J. F. (2013). Synthesis from LTL specifications with mean-payoff objectives. In Piterman, N., & Smolka, S.A. (eds.) TACAS, Lecture Notes in Computer Science, (vol. 7795, pp. 169\u2013184). Springer.","DOI":"10.1007\/978-3-642-36742-7_12"},{"key":"9531_CR14","doi-asserted-by":"publisher","unstructured":"Bouyer, P., Brenguier, R., Markey, N., & Ummels, M. (2011). Nash equilibria in concurrent games with B\u00fcchi objectives. In Chakraborty, S., & Kumar, A. (eds.) FSTTCS\u20192011 LIPIcs, (pp. 375\u2013386). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2011.375.","DOI":"10.4230\/LIPIcs.FSTTCS.2011.375"},{"key":"9531_CR15","doi-asserted-by":"publisher","unstructured":"Bouyer, P., Brenguier, R., Markey, N., & Ummels, M. (2012). Concurrent games with ordered objectives. In Birkedal, L. (ed.) Proc. of FoSSaCS\u20192012, Springer LNCS, (vol. 7213, pp. 301\u2013315). https:\/\/doi.org\/10.1007\/978-3-642-28729-9_20.","DOI":"10.1007\/978-3-642-28729-9_20"},{"issue":"2","key":"9531_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00236-016-0274-1","volume":"55","author":"P Bouyer","year":"2018","unstructured":"Bouyer, P., Markey, N., Randour, M., Larsen, K. G., & Laursen, S. (2018). Average-energy games. Acta Informatica, 55(2), 91\u2013127. https:\/\/doi.org\/10.1007\/s00236-016-0274-1.","journal-title":"Acta Informatica"},{"key":"9531_CR17","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Jancar, P., & Kucera, A. (2010). Reachability games on extended vector addition systems with states. In S.\u00a0Abramsky, C.G. and\u00df Claude\u00a0Kirchner, F.M. auf\u00a0der Heide, P.G. Spirakis (eds.) Proceedings of ICALP 2010, Part II, Lecture Notes in Computer Science, (vol. 6199, pp. 478\u2013489). Springer.","DOI":"10.1007\/978-3-642-14162-1_40"},{"key":"9531_CR18","doi-asserted-by":"crossref","unstructured":"Bulling, N., & Farwer, B. (2010). Expressing properties of resource-bounded systems: The logics RBTL and RBTL$$^*$$. In Dix, J., Fisher, M., & Novak, P. (eds.) Post-Proceedings of CLIMA \u201909, no. 6214 in LNCS 6214, (pp. 22\u201345). Hamburg, Germany.","DOI":"10.1007\/978-3-642-16867-3_2"},{"key":"9531_CR19","doi-asserted-by":"publisher","unstructured":"Bulling, N., & Farwer, B. (2010). On the (Un-)Decidability of Model-Checking Resource-Bounded Agents. In: Coelho, H., & Wooldridge, M. (eds.) Proc. of ECAI 2010, (pp. 567\u2013572). IOS Press, Amsterdam. https:\/\/doi.org\/10.3233\/978-1-60750-606-5-567.","DOI":"10.3233\/978-1-60750-606-5-567"},{"key":"9531_CR20","doi-asserted-by":"publisher","unstructured":"Bulling, N., & Goranko, V. (2013). How to be both rich and happy: Combining quantitative and qualitative strategic reasoning about multi-player games (extended abstract). In Proceedings of the 1st International Workshop on Strategic Reasoning, Electronic Proceedings in Theoretical Computer Science, (pp. 33\u201341). Rome, Italy. https:\/\/doi.org\/10.4204\/EPTCS.112.8.","DOI":"10.4204\/EPTCS.112.8"},{"key":"9531_CR21","doi-asserted-by":"publisher","unstructured":"Bulling, N., Goranko, V., & Jamroga, W. (2015). Logics for reasoning about strategic abilities in multi-player games. In van Benthem, J., Ghosh, S., & Verbrugge, R. (eds.) Models of Strategic Reasoning - Logics, Games, and Communities, Lecture Notes in Computer Science, (vol. 8972, pp. 93\u2013136). Springer. https:\/\/doi.org\/10.1007\/978-3-662-48540-8.","DOI":"10.1007\/978-3-662-48540-8"},{"key":"9531_CR22","doi-asserted-by":"publisher","unstructured":"Bu\u015foniu, L., Babu\u0161ka, R., & De\u00a0Schutter, B. (2010). Multi-agent Reinforcement Learning: An Overview, pp. 183\u2013221. Springer Berlin Heidelberg, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-14435-6_7.","DOI":"10.1007\/978-3-642-14435-6_7"},{"key":"9531_CR23","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. F. (2010). Generalized mean-payoff and energy games. In Lodaya, K., & Mahajan, M. (eds.) Proc. of FSTTCS\u20192010, LIPIcs, (vol.\u00a08, pp. 505\u2013516). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik."},{"key":"9531_CR24","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T. A., & Jurdzinski, M. (2005). Mean-payoff parity games. In Proc. of LICS\u20192005, (pp. 178\u2013187). IEEE Computer Society.","DOI":"10.1109\/LICS.2005.26"},{"issue":"4","key":"9531_CR25","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/1970398.1970404","volume":"12","author":"K Chatterjee","year":"2011","unstructured":"Chatterjee, K., de Alfaro, L., & Henzinger, T. A. (2011). Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL), 12(4), 28. https:\/\/doi.org\/10.1145\/1970398.1970404.","journal-title":"ACM Transactions on Computational Logic (TOCL)"},{"key":"9531_CR26","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2012.07.038","volume":"458","author":"K Chatterjee","year":"2012","unstructured":"Chatterjee, K., & Doyen, L. (2012). Energy parity games. Theoretical Computer Science, 458, 49\u201360. https:\/\/doi.org\/10.1016\/j.tcs.2012.07.038.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"9531_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ipl.2007.08.035","volume":"106","author":"K Chatterjee","year":"2008","unstructured":"Chatterjee, K., & Henzinger, T. A. (2008). Reduction of stochastic parity to stochastic mean-payoff games. Information Processing Letters, 106(1), 1\u20137.","journal-title":"Information Processing Letters"},{"issue":"2","key":"9531_CR28","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.jcss.2011.05.002","volume":"78","author":"K Chatterjee","year":"2012","unstructured":"Chatterjee, K., & Henzinger, T. A. (2012). A survey of stochastic $$\\omega$$-regular games. Journal of Computer and System Sciences, 78(2), 394\u2013413.","journal-title":"Journal of Computer and System Sciences"},{"key":"9531_CR29","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., & Henzinger, T. A. (2000). Concurrent omega-regular games. In Proceedings of LICS, vol. 2000, pp. 141\u2013154.","DOI":"10.1109\/LICS.2000.855763"},{"issue":"3","key":"9531_CR30","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.tcs.2007.07.008","volume":"386","author":"L de Alfaro","year":"2007","unstructured":"de Alfaro, L., Henzinger, T. A., & Kupferman, O. (2007). Concurrent reachability games. Theoretical Computer Science, 386(3), 188\u2013217. https:\/\/doi.org\/10.1016\/j.tcs.2007.07.008.","journal-title":"Theoretical Computer Science"},{"key":"9531_CR31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139236119","volume-title":"Temporal Logics in Computer Science","author":"S Demri","year":"2016","unstructured":"Demri, S., Goranko, V., & Lange, M. (2016). Temporal Logics in Computer Science. Cambridge: Cambridge University Press."},{"key":"9531_CR32","doi-asserted-by":"publisher","unstructured":"Esparza, J. (1998). Decidability and complexity of petri net problems\u2014an introduction. In In Lectures on Petri Nets I: Basic Models, (pp. 374\u2013428). Springer-Verlag. https:\/\/doi.org\/10.1007\/3-540-65306-6_20.","DOI":"10.1007\/3-540-65306-6_20"},{"key":"9531_CR33","doi-asserted-by":"crossref","unstructured":"Esparza, J., & Nielsen, M. (1994). Decidability issues for petri nets - a survey.","DOI":"10.7146\/brics.v1i8.21662"},{"key":"9531_CR34","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s002360050074","volume":"34","author":"J Esparza","year":"1997","unstructured":"Esparza, J. (1997). Decidability of model checking for infinite-state concurrent systems. Acta Informatica, 34, 85\u2013107. https:\/\/doi.org\/10.1007\/s002360050074.","journal-title":"Acta Informatica"},{"key":"9531_CR35","volume-title":"Game theory","author":"D Fudenberg","year":"1991","unstructured":"Fudenberg, D., & Tirole, J. (1991). Game theory. Cambridge: MIT Press."},{"issue":"1","key":"9531_CR36","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.tcs.2005.07.043","volume":"353","author":"V Goranko","year":"2006","unstructured":"Goranko, V., & van Drimmelen, G. (2006). Complete axiomatization and decidability of alternating-time temporal logic. Theoretical Computer Science, 353(1), 93\u2013117.","journal-title":"Theoretical Computer Science"},{"key":"9531_CR37","unstructured":"Gr\u00e4del, E., & Ummels, M. (2008). Solution Concepts and Algorithms for Infinite Multiplayer Games. In Apt, K., & van Rooij, R. (eds.) New Perspectives on Games and Interaction, Texts in Logic and Games, vol.\u00a04, pp. 151\u2013178. Amsterdam University Press. http:\/\/www.logic.rwth-aachen.de\/~ummels\/knaw07.pdf."},{"key":"9531_CR38","doi-asserted-by":"publisher","unstructured":"Haase, C., & Halfon, S. (2014) Integer vector addition systems with states. In Ouaknine, J., Potapov, I., & Worrell, J. (eds.) Proceedings of RP 2014, Lecture Notes in Computer Science, (vol. 8762, pp. 112\u2013124). Springer. https:\/\/doi.org\/10.1007\/978-3-319-11439-2n_9.","DOI":"10.1007\/978-3-319-11439-2n_9"},{"key":"9531_CR39","doi-asserted-by":"publisher","unstructured":"Hansen, K. A., Ibsen-Jensen, R., & Neyman, A. (2018). The big match with a clock and a bit of memory. In Tardos, \u00c9, Elkind, E., & Vohra, R. (eds.) Proceedings of the 2018 ACM Conference on Economics and Computation, Ithaca, NY, USA, June 18-22, 2018, (pp. 149\u2013150). ACM. https:\/\/doi.org\/10.1145\/3219166.3219198.","DOI":"10.1145\/3219166.3219198"},{"key":"9531_CR40","doi-asserted-by":"publisher","DOI":"10.1145\/568438.568455","volume-title":"Introduction to automata theory, languages, and computation","author":"J Hopcroft","year":"1979","unstructured":"Hopcroft, J., & Ullman, J. (1979). Introduction to automata theory, languages, and computation. Reading: Addison-Wesley. https:\/\/doi.org\/10.1145\/568438.568455."},{"issue":"1","key":"9531_CR41","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0304-3975(01)00268-7","volume":"289","author":"OH Ibarra","year":"2002","unstructured":"Ibarra, O. H., Su, J., Dang, Z., Bultan, T., & Kemmerer, R. A. (2002). Counter machines and verification problems. Theoretical Computer Science, 289(1), 165\u2013189. https:\/\/doi.org\/10.1016\/S0304-3975(01)00268-7.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"9531_CR42","doi-asserted-by":"publisher","first-page":"423","DOI":"10.3166\/jancl.17.423-475","volume":"17","author":"W Jamroga","year":"2007","unstructured":"Jamroga, W., & \u00c5gotnes, T. (2007). Constructive knowledge: What agents can achieve under incomplete information. Journal of Applied Non-Classical Logics, 17(4), 423\u2013475. https:\/\/doi.org\/10.3166\/jancl.17.423-475.","journal-title":"Journal of Applied Non-Classical Logics"},{"issue":"2\u20133","key":"9531_CR43","first-page":"185","volume":"63","author":"W Jamroga","year":"2004","unstructured":"Jamroga, W., & van der Hoek, W. (2004). Agents that know how to play. Fundamenta Informaticae, 63(2\u20133), 185\u2013219.","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"9531_CR44","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp, R. M., & Miller, R. E. (1969). Parallel program schemata. Journal of Computer and System Sciences, 3(2), 147\u2013195.","journal-title":"Journal of Computer and System Sciences"},{"key":"9531_CR45","volume-title":"Computation. Finite and Infinite Machines","author":"M Minsky","year":"1967","unstructured":"Minsky, M. (1967). Computation. Finite and Infinite Machines. Hoboken: Prentice Hall."},{"key":"9531_CR46","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.entcs.2011.10.017","volume":"278","author":"DD Monica","year":"2011","unstructured":"Monica, D. D., Napoli, M., & Parente, M. (2011). On a logic for coalitional games with priced-resource agents. Electronic Notes in Theoretical Computer Science, 278, 215\u2013228. https:\/\/doi.org\/10.1016\/j.entcs.2011.10.017.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"9531_CR47","volume-title":"Stochastic Games and Applications, NATO Science Series book series (ASIC)","year":"2003","unstructured":"Neyman, A., & Sorin, S. (Eds.). (2003). Stochastic Games and Applications, NATO Science Series book series (ASIC) (Vol. 570). Berlin: Springer."},{"issue":"4","key":"9531_CR48","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1093\/logcom\/exv034","volume":"28","author":"HN Nguyen","year":"2018","unstructured":"Nguyen, H. N., Alechina, N., Logan, B., & Rakib, A. (2018). Alternating-time temporal logic with resource bounds. Journal of Logic and Computation, 28(4), 631\u2013663. https:\/\/doi.org\/10.1093\/logcom\/exv034.","journal-title":"Journal of Logic and Computation"},{"key":"9531_CR49","volume-title":"A Course in Game Theory","author":"M Osborne","year":"1994","unstructured":"Osborne, M., & Rubinstein, A. (1994). A Course in Game Theory. Cambridge: MIT Press."},{"issue":"1","key":"9531_CR50","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/logcom\/12.1.149","volume":"12","author":"M Pauly","year":"2002","unstructured":"Pauly, M. (2002). A modal logic for coalitional power in games. Journal of Logic and Computation, 12(1), 149\u2013166. https:\/\/doi.org\/10.1093\/logcom\/12.1.149.","journal-title":"Journal of Logic and Computation"},{"key":"9531_CR51","unstructured":"Peters, H., & Vrieze, O. (Eds.). (1987). Surveys in Game Theory and Related Topics. Amsterdam: CWI."},{"key":"9531_CR52","doi-asserted-by":"publisher","unstructured":"Pinchinat, S. (2007). A generic constructive solution for concurrent games with expressive constraints on strategies. In K.N. et\u00a0al (ed.) Proc. of ATVA\u20192007, Springer LNCS, (vol. 4762, pp. 253\u2013267). https:\/\/doi.org\/10.1007\/978-3-540-75596-8_19.","DOI":"10.1007\/978-3-540-75596-8_19"},{"key":"9531_CR53","doi-asserted-by":"crossref","unstructured":"Schewe, S. (2008). ATL* satisfiability is 2ExpTime-complete. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming, Part II (ICALP 2008), 6\u201313 July, Reykjavik, Iceland, Lecture Notes in Computer Science, vol. 5126, pp. 373\u2013385. Springer-Verlag.","DOI":"10.1007\/978-3-540-70583-3_31"},{"key":"9531_CR54","first-page":"1","volume-title":"Stochastic Games and Applications","author":"LS Shapley","year":"2003","unstructured":"Shapley, L. S. (2003). Stochastic games. In A. Neyman & S. Sorin (Eds.), Stochastic Games and Applications (pp. 1\u20137). Berlin: Springer."},{"issue":"7","key":"9531_CR55","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.artint.2006.02.006","volume":"171","author":"Y Shoham","year":"2007","unstructured":"Shoham, Y., Powers, R., & Grenager, T. (2007). If multi-agent learning is the answer, what is the question? Artificial Intelligence, 171(7), 365\u2013377. https:\/\/doi.org\/10.1016\/j.artint.2006.02.006.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"9531_CR56","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1026185103185","volume":"75","author":"W van der Hoek","year":"2003","unstructured":"van der Hoek, W., & Wooldridge, M. (2003). Cooperation, knowledge and time: Alternating-time Temporal Epistemic Logic and its applications. Studia Logica, 75(1), 125\u2013157.","journal-title":"Studia Logica"},{"key":"9531_CR57","doi-asserted-by":"crossref","unstructured":"van Ditmarsch, H., & Knight, S. (2014). Partial information and uniform strategies. In Bulling, N., van\u00a0der Torre, L.W.N., Villata, S., Jamroga, W., & Vasconcelos, W.W. (eds.) Computational Logic in Multi-Agent Systems - 15th International Workshop, CLIMA XV, Prague, Czech Republic, August 18-19, 2014. Proceedings, Lecture Notes in Computer Science, (vol. 8624, pp. 183\u2013198). Springer.","DOI":"10.1007\/978-3-319-09764-0_12"},{"key":"9531_CR58","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ic.2015.03.001","volume":"241","author":"Y Velner","year":"2015","unstructured":"Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T. A., Rabinovich, A. M., & Raskin, J. (2015). The complexity of multi-mean-payoff and multi-energy games. Information & Computation, 241, 177\u2013196. https:\/\/doi.org\/10.1016\/j.ic.2015.03.001.","journal-title":"Information & Computation"},{"key":"9531_CR59","doi-asserted-by":"crossref","unstructured":"Zielonka, W. (2005). An invitation to play. In Jedrzejowicz, J., & Szepietowski, A. (eds.) Proc. of MFCS\u20192005, LNCS, (vol. 3618, pp. 58\u201370). Springer.","DOI":"10.1007\/11549345_7"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-021-09531-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-021-09531-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-021-09531-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,28]],"date-time":"2022-04-28T17:33:02Z","timestamp":1651167182000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-021-09531-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,9]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["9531"],"URL":"https:\/\/doi.org\/10.1007\/s10458-021-09531-9","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,9]]},"assertion":[{"value":"23 August 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"2"}}