{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T04:10:24Z","timestamp":1723263024079},"reference-count":58,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["952215"],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014013","name":"UK Research and Innovation","doi-asserted-by":"publisher","award":["EP\/W002949\/1"],"id":[{"id":"10.13039\/100014013","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/L015897\/1"],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000769","name":"University of Oxford","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000769","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1958\/20"],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1016\/j.artint.2022.103806","type":"journal-article","created":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T21:42:13Z","timestamp":1666993333000},"page":"103806","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Cooperative concurrent games"],"prefix":"10.1016","volume":"314","author":[{"given":"Julian","family":"Gutierrez","sequence":"first","affiliation":[]},{"given":"Szymon","family":"Kowara","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-4672-623X","authenticated-orcid":false,"given":"Sarit","family":"Kraus","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9328-8418","authenticated-orcid":false,"given":"Thomas","family":"Steeples","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-9329-8410","authenticated-orcid":false,"given":"Michael","family":"Wooldridge","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.artint.2022.103806_br0010","series-title":"AAMAS, IFAAMAS","first-page":"1198","article-title":"Cooperative concurrent games","author":"Gutierrez","year":"2019"},{"key":"10.1016\/j.artint.2022.103806_br0020","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.ic.2015.03.011","article-title":"Iterated boolean games","volume":"242","author":"Gutierrez","year":"2015","journal-title":"Inf. Comput."},{"key":"10.1016\/j.artint.2022.103806_br0030","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.artint.2017.04.003","article-title":"From model checking to equilibrium checking: reactive modules for rational verification","volume":"248","author":"Gutierrez","year":"2017","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2022.103806_br0040","series-title":"Proc. of AAAI","first-page":"4184","article-title":"Rational verification: from model checking to equilibrium checking","author":"Wooldridge","year":"2016"},{"issue":"9","key":"10.1016\/j.artint.2022.103806_br0050","doi-asserted-by":"crossref","first-page":"6569","DOI":"10.1007\/s10489-021-02658-y","article-title":"Rational verification: game-theoretic verification of multi-agent systems","volume":"51","author":"Abate","year":"2021","journal-title":"Appl. Intell."},{"issue":"5","key":"10.1016\/j.artint.2022.103806_br0060","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1145\/585265.585270","article-title":"Alternating-time temporal logic","volume":"49","author":"Alur","year":"2002","journal-title":"J. ACM"},{"key":"10.1016\/j.artint.2022.103806_br0070","series-title":"Formal Models and Semantics","first-page":"995","article-title":"Temporal and modal logic","author":"Emerson","year":"1990"},{"year":"2002","series-title":"Model Checking","author":"Clarke","key":"10.1016\/j.artint.2022.103806_br0080"},{"key":"10.1016\/j.artint.2022.103806_br0090","series-title":"ATVA","first-page":"551","article-title":"EVE: a tool for temporal equilibrium analysis","volume":"vol. 11138","author":"Gutierrez","year":"2018"},{"issue":"1","key":"10.1016\/j.artint.2022.103806_br0100","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s10009-015-0378-x","article-title":"MCMAS: an open-source model checker for the verification of multi-agent systems","volume":"19","author":"Lomuscio","year":"2017","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"10.1016\/j.artint.2022.103806_br0110","series-title":"CAV","first-page":"890","article-title":"PRALINE: a tool for computing Nash equilibria in concurrent games","volume":"vol. 8044","author":"Brenguier","year":"2013"},{"key":"10.1016\/j.artint.2022.103806_br0120","series-title":"Computer Aided Verification - 32nd International Conference, CAV 2020, Proceedings, Part II","first-page":"475","article-title":"{PRISM}-games 3.0: stochastic game verification with concurrency, equilibria and time","volume":"vol. 12225","author":"Kwiatkowska","year":"2020"},{"year":"1994","series-title":"A Course in Game Theory","author":"Osborne","key":"10.1016\/j.artint.2022.103806_br0130"},{"year":"2013","series-title":"Game Theory","author":"Maschler","key":"10.1016\/j.artint.2022.103806_br0140"},{"year":"2011","series-title":"Computational Aspects of Cooperative Game Theory","author":"Chalkiadakis","key":"10.1016\/j.artint.2022.103806_br0150"},{"key":"10.1016\/j.artint.2022.103806_br0160","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.jet.2015.04.005","article-title":"On the nonemptiness of the \u03b1-core of discontinuous games: transferable and nontransferable utilities","volume":"158","author":"Uyan\u0131k","year":"2015","journal-title":"J. Econ. Theory"},{"key":"10.1016\/j.artint.2022.103806_br0170","series-title":"CONCUR","article-title":"Nash equilibrium and bisimulation invariance","volume":"vol. 85","author":"Gutierrez","year":"2017"},{"issue":"2","key":"10.1016\/j.artint.2022.103806_br0180","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01768705","article-title":"Positional strategies for mean payoff games","volume":"8","author":"Ehrenfeucht","year":"1979","journal-title":"Int. J. Game Theory"},{"key":"10.1016\/j.artint.2022.103806_br0190","series-title":"32nd Annual Symposium on Foundations of Computer Science","first-page":"368","article-title":"Tree automata, mu-calculus and determinacy (extended abstract)","author":"Emerson","year":"1991"},{"key":"10.1016\/j.artint.2022.103806_br0200","series-title":"CONCUR 2005 - Concurrency Theory, 16th International Conference, Proceedings","first-page":"428","article-title":"Games where you can play optimally without any memory","volume":"vol. 3653","author":"Gimbert","year":"2005"},{"key":"10.1016\/j.artint.2022.103806_br0210","series-title":"Automata, Languages and Programming, 33rd International Colloquium, Proceedings, Part II","first-page":"336","article-title":"Half-positional determinacy of infinite games","volume":"vol. 4052","author":"Kopczynski","year":"2006"},{"key":"10.1016\/j.artint.2022.103806_br0220","series-title":"18th Annual Symposium on Foundations of Computer Science (sfcs 1977)","first-page":"46","article-title":"The temporal logic of programs","author":"Pnueli","year":"1977"},{"issue":"4","key":"10.1016\/j.artint.2022.103806_br0230","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2631917","article-title":"Reasoning about strategies","volume":"15","author":"Mogavero","year":"2014","journal-title":"ACM Trans. Comput. Log."},{"year":"2008","series-title":"Principles of Model Checking","author":"Baier","key":"10.1016\/j.artint.2022.103806_br0240"},{"issue":"7","key":"10.1016\/j.artint.2022.103806_br0250","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","article-title":"Formal verification of parallel programs","volume":"19","author":"Keller","year":"1976","journal-title":"Commun. ACM"},{"issue":"5\u20136","key":"10.1016\/j.artint.2022.103806_br0260","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/malq.19630090502","article-title":"Semantical analysis of modal logic i normal modal propositional calculi","volume":"9","author":"Kripke","year":"1963","journal-title":"Z. Math. Log. Grundl. Math."},{"issue":"1","key":"10.1016\/j.artint.2022.103806_br0270","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/4904.4999","article-title":"\u201cSometimes\u201d and \u201cnot never\u201d revisited","volume":"33","author":"Emerson","year":"1986","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/j.artint.2022.103806_br0280","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/3828.3837","article-title":"The complexity of propositional linear temporal logics","volume":"32","author":"Sistla","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/j.artint.2022.103806_br0290","series-title":"Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages","first-page":"179","article-title":"On the synthesis of a reactive module","author":"Pnueli","year":"1989"},{"key":"10.1016\/j.artint.2022.103806_br0300","series-title":"Tools and Algorithms for the Construction and Analysis of Systems, 16th International Conference, TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, Proceedings","first-page":"190","article-title":"Rational synthesis","volume":"vol. 6015","author":"Fisman","year":"2010"},{"key":"10.1016\/j.artint.2022.103806_br0310","series-title":"Contributions to the Theory of Games, Vol. IV","first-page":"287","article-title":"Acceptable points in general cooperative n-person games","volume":"vol. 40","author":"Aumann","year":"1959"},{"key":"10.1016\/j.artint.2022.103806_br0320","doi-asserted-by":"crossref","first-page":"381","DOI":"10.2140\/pjm.1960.10.381","article-title":"Acceptable points in games of perfect information","volume":"10","author":"Aumann","year":"1960","journal-title":"Pac. J. Math."},{"issue":"1","key":"10.1016\/j.artint.2022.103806_br0330","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-0531(87)90099-8","article-title":"Coalition-proof Nash equilibria I. Concepts","volume":"42","author":"Bernheim","year":"1987","journal-title":"J. Econ. Theory"},{"issue":"1","key":"10.1016\/j.artint.2022.103806_br0340","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0022-0531(87)90100-1","article-title":"Coalition-proof Nash equilibria II. Applications","volume":"42","author":"Bernheim","year":"1987","journal-title":"J. Econ. Theory"},{"issue":"1","key":"10.1016\/j.artint.2022.103806_br0350","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for nondeterminism and concurrency","volume":"32","author":"Hennessy","year":"1985","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.artint.2022.103806_br0360","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/963927.963928","article-title":"Deterministic generators and games for Ltl fragments","volume":"5","author":"Alur","year":"2004","journal-title":"ACM Trans. Comput. Log."},{"issue":"2","key":"10.1016\/j.artint.2022.103806_br0370","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1145\/333979.333987","article-title":"An automata-theoretic approach to branching-time model checking","volume":"47","author":"Kupferman","year":"2000","journal-title":"J. ACM"},{"year":"1989","series-title":"Communication and Concurrency","author":"Milner","key":"10.1016\/j.artint.2022.103806_br0380"},{"issue":"2","key":"10.1016\/j.artint.2022.103806_br0390","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1006\/game.1997.0567","article-title":"Stable coalition structures with externalities","volume":"20","author":"Yi","year":"1997","journal-title":"Games Econ. Behav."},{"key":"10.1016\/j.artint.2022.103806_br0400","doi-asserted-by":"crossref","DOI":"10.2139\/ssrn.406400","article-title":"A non-cooperative foundation of core-stability in positive externality {NTU}-coalition games","author":"Finus","year":"2003","journal-title":"SSRN Electron. J."},{"key":"10.1016\/j.artint.2022.103806_br0410","series-title":"Internet and Network Economics, Third International Workshop, Proceedings","first-page":"469","article-title":"Weighted boolean formula games","volume":"vol. 4858","author":"Mavronicolas","year":"2007"},{"key":"10.1016\/j.artint.2022.103806_br0420","series-title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI'18, International Joint Conferences on Artificial Intelligence Organization","first-page":"35","article-title":"Synthesis of controllable Nash equilibria in quantitative objective game","author":"Almagor","year":"2018"},{"issue":"1","key":"10.1016\/j.artint.2022.103806_br0430","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10472-016-9508-8","article-title":"Synthesis with rational environments","volume":"78","author":"Kupferman","year":"2016","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1\u20132","key":"10.1016\/j.artint.2022.103806_br0440","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","article-title":"The complexity of mean payoff games on graphs","volume":"158","author":"Zwick","year":"1996","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.artint.2022.103806_br0450","article-title":"The complexity of Nash equilibria in stochastic multiplayer games","volume":"7","author":"Ummels","year":"2011","journal-title":"Log. Methods Comput. Sci."},{"issue":"3","key":"10.1016\/j.artint.2022.103806_br0460","first-page":"309","article-title":"A characterization of the minimum cycle mean in a digraph","volume":"23","author":"Karp","year":"1978","journal-title":"Universitext"},{"key":"10.1016\/j.artint.2022.103806_br0470","series-title":"Computer Aided Verification - 27th International Conference, Proceedings, Part II","first-page":"251","article-title":"Pareto curves of multidimensional mean-payoff games","volume":"vol. 9207","author":"Brenguier","year":"2015"},{"key":"10.1016\/j.artint.2022.103806_br0480","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ic.2015.03.001","article-title":"The complexity of multi-mean-payoff and multi-energy games","volume":"241","author":"Velner","year":"2015","journal-title":"Inf. Comput."},{"key":"10.1016\/j.artint.2022.103806_br0490","unstructured":"P. Chander, et al., Cores of games with positive externalities, CORE DP 2010\/4, 2010."},{"issue":"4","key":"10.1016\/j.artint.2022.103806_br0500","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s00182-006-0067-9","article-title":"The gamma-core and coalition formation","volume":"35","author":"Chander","year":"2007","journal-title":"Int. J. Game Theory"},{"issue":"1","key":"10.1016\/j.artint.2022.103806_br0510","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1006\/jeth.1996.2236","article-title":"Equilibrium binding agreements","volume":"73","author":"Ray","year":"1997","journal-title":"J. Econ. Theory"},{"issue":"1\u20132","key":"10.1016\/j.artint.2022.103806_br0520","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0004-3702(98)00045-9","article-title":"Methods for task allocation via agent coalition formation","volume":"101","author":"Shehory","year":"1998","journal-title":"Artif. Intell."},{"issue":"6","key":"10.1016\/j.artint.2022.103806_br0530","first-page":"5603","article-title":"Coalition formation in multi-defender security games","volume":"35","author":"Mutzari","year":"2021","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"10.1016\/j.artint.2022.103806_br0540","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.artint.2012.03.007","article-title":"Anytime coalition structure generation in multi-agent systems with positive or negative externalities","volume":"186","author":"Rahwan","year":"2012","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2022.103806_br0550","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.jet.2015.01.011","article-title":"Rational bargaining in games with coalitional externalities","volume":"157","author":"Borm","year":"2015","journal-title":"J. Econ. Theory"},{"key":"10.1016\/j.artint.2022.103806_br0560","series-title":"Formal Methods in Computer Aided Design (FMCAD'07)","first-page":"190","article-title":"What triggers a behavior?","volume":"vol. 6015","author":"Kupferman","year":"2007"},{"key":"10.1016\/j.artint.2022.103806_br0570","series-title":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","first-page":"2038","article-title":"Verifying and synthesising multi-agent systems against one-goal strategy logic specifications","author":"Cerm\u00e1k","year":"2015"},{"year":"1995","series-title":"Reasoning About Knowledge","author":"Fagin","key":"10.1016\/j.artint.2022.103806_br0580"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370222001461?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370222001461?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T03:52:50Z","timestamp":1723261970000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370222001461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":58,"alternative-id":["S0004370222001461"],"URL":"https:\/\/doi.org\/10.1016\/j.artint.2022.103806","relation":{},"ISSN":["0004-3702"],"issn-type":[{"type":"print","value":"0004-3702"}],"subject":[],"published":{"date-parts":[[2023,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Cooperative concurrent games","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.artint.2022.103806","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"103806"}}