{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T07:16:23Z","timestamp":1712301383152},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2008,8,1]],"date-time":"2008-08-01T00:00:00Z","timestamp":1217548800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s10472-009-9110-4","type":"journal-article","created":{"date-parts":[[2009,1,28]],"date-time":"2009-01-28T12:09:51Z","timestamp":1233144591000},"page":"51-114","source":"Crossref","is-referenced-by-count":9,"title":["Reasoning about temporal properties of rational play"],"prefix":"10.1007","volume":"53","author":[{"given":"Nils","family":"Bulling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Jamroga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Dix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,1,29]]},"reference":[{"key":"9110_CR1","doi-asserted-by":"crossref","unstructured":"\u00c5gotnes, T., Goranko, V., Jamroga, W.: Alternating-time temporal logics with irrevocable strategies. In: Samet, D. (ed.) Proceedings of TARK XI, pp. 15\u201324 (2007)","DOI":"10.1145\/1324249.1324256"},{"key":"9110_CR2","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/SFCS.1997.646098","volume-title":"Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS)","author":"R. Alur","year":"1997","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), pp. 100\u2013109. IEEE Computer Society Press, Silver Spring (1997)"},{"key":"9110_CR3","doi-asserted-by":"crossref","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":"9110_CR4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF00169710","volume":"27","author":"M. Bacharach","year":"1987","unstructured":"Bacharach, M.: A theory of rational decision in games. Erkenntnis 27, 17\u201355 (1987)","journal-title":"Erkenntnis"},{"issue":"1","key":"9110_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/1467-8586.00138","volume":"54","author":"A. Baltag","year":"2002","unstructured":"Baltag, A.: A logic for suspicious players. Bull. Econ. Res. 54(1), 1\u201346 (2002)","journal-title":"Bull. Econ. Res."},{"key":"9110_CR6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1017\/S0266267100000900","volume":"7","author":"G. Bonanno","year":"1991","unstructured":"Bonanno, G.: The logic of rational play in games of perfect information. Econ. Philos. 7, 37\u201365 (1991)","journal-title":"Econ. Philos."},{"key":"9110_CR7","doi-asserted-by":"crossref","unstructured":"Brihaye, T., Da Costa, A., Laroussinie, F., Markey, N.: ATL with strategy contexts and bounded memory. Technical report LSV-08-14, ENS Cachan (2008)","DOI":"10.1007\/978-3-540-92687-0_7"},{"key":"9110_CR8","unstructured":"Bulling, N.: Modal logics for games, time, and beliefs. Master thesis, Clausthal University of Technology (2006)"},{"key":"9110_CR9","doi-asserted-by":"crossref","unstructured":"Bulling, N., Jamroga, W.: Agents, beliefs and plausible behaviour in a temporal setting. Technical report IfI-06-05, Clausthal University of Technology (2006)","DOI":"10.1145\/1329125.1329303"},{"key":"9110_CR10","doi-asserted-by":"crossref","unstructured":"Bulling, N., Jamroga, W.: Agents, beliefs and plausible behaviour in a temporal setting. In: Proceedings of AAMAS\u201907, pp. 570\u2013577 (2007)","DOI":"10.1145\/1329125.1329303"},{"key":"9110_CR11","doi-asserted-by":"crossref","unstructured":"Bulling, N., Jamroga, W.: A logic for reasoning about rational agents: yet another attempt. In: Czaja, L. (ed.) Proceedings of CS&P, pp. 87\u201399 (2007)","DOI":"10.1145\/1329125.1329232"},{"issue":"1","key":"9110_CR12","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s001820100066","volume":"30","author":"F. Chu","year":"2001","unstructured":"Chu, F., Halpern, J.: On the NP-completeness of finding an optimal strategy in games with common payoffs. Int. J. Game Theory. 30(1), 99\u2013106 (2001)","journal-title":"Int. J. Game Theory"},{"key":"9110_CR13","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Proceedings of Logics of Programs Workshop. Lecture Notes in Computer Science, vol. 131, pp. 52\u201371 (1981)","DOI":"10.1007\/BFb0025774"},{"issue":"2","key":"9110_CR14","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E.M. Clarke","year":"1986","unstructured":"Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst. 8(2), 244\u2013263 (1986)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9110_CR15","unstructured":"Conitzer, V., Sandholm, T.: Complexity results about Nash equilibria. Technical report CMU-CS-02-135, School of Computer Science, Carnegie-Mellon University (2002)"},{"key":"9110_CR16","doi-asserted-by":"crossref","unstructured":"Friedman, N., Halpern, J.Y.: A knowledge-based framework for belief change, Part I: foundations. In: Proceedings of TARK, pp. 44\u201364 (1994)","DOI":"10.1016\/B978-1-4832-1453-5.50007-6"},{"key":"9110_CR17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, W.H., San Francisco (1979)"},{"key":"9110_CR18","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0899-8256(89)90006-7","volume":"1","author":"I. Gilboa","year":"1989","unstructured":"Gilboa, I., Zemel, E.: Nash and correlated equilibria: some complexity considerations. Games Econom. Behav. 1, 80\u201393 (1989)","journal-title":"Games Econom. Behav."},{"issue":"2","key":"9110_CR19","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/B:SYNT.0000024915.66183.d1","volume":"139","author":"V. Goranko","year":"2004","unstructured":"Goranko, V., Jamroga, W.: Comparing semantics of logics for multi-agent systems. Synthese 139(2), 241\u2013280 (2004)","journal-title":"Synthese"},{"issue":"2\u20134","key":"9110_CR20","first-page":"281","volume":"57","author":"B.P. Harrenstein","year":"2003","unstructured":"Harrenstein, B.P., van der Hoek, W., Meyer, J.-J., Witteveen, C.: A modal characterization of Nash equilibrium. Fundam. Inform. 57(2\u20134), 281\u2013321 (2003)","journal-title":"Fundam. Inform."},{"key":"9110_CR21","unstructured":"Harrenstein, P., van der Hoek, W., Meijer, J-J., Witteveen, C.: Subgame-perfect Nash equilibria in dynamic logic. In: Pauly, M., Baltag, A. (eds.) Proceedings of the ILLC Workshop on Logic and Games, pp. 29\u201330. University of Amsterdam (2002) Tech. Report PP-1999-25."},{"key":"9110_CR22","doi-asserted-by":"crossref","unstructured":"Herzig, A., Troquard, N.: Knowing how to play: uniform choices in logics of agency. In: Proceedings of AAMAS\u201906, pp. 209\u2013216 (2006)","DOI":"10.1145\/1160633.1160666"},{"key":"9110_CR23","unstructured":"Jamroga, W.: Reducing knowledge operators in the context of model checking. Technical report IfI-07-09, Clausthal University of Technology (2007)"},{"key":"9110_CR24","first-page":"232","volume-title":"Proceedings of AAMAS\u201906","author":"W. Jamroga","year":"2006","unstructured":"Jamroga, W., \u00c5gotnes, T.: What agents can achieve under incomplete information. In: Proceedings of AAMAS\u201906, pp. 232\u2013234. ACM, New York (2006)"},{"key":"9110_CR25","doi-asserted-by":"crossref","unstructured":"Jamroga, W., Bulling, N.: A framework for reasoning about rational agents. In: Proceedings of AAMAS\u201907, pp. 592\u2013594 (2007)","DOI":"10.1145\/1329125.1329232"},{"key":"9110_CR26","doi-asserted-by":"crossref","unstructured":"Jamroga, W., Bulling, N.: A logic for reasoning about rational agents. In: Sadri, F., Satoh, K. (eds.) Computational Logic in Multi-Agent Systems, 8th InternationalWorkshop, CLIMA VIII, Revised Selected and Invited Papers. Lecture Notes, Porto, Portugal, September. pp. 42\u201361. Springer (2007)","DOI":"10.1007\/978-3-540-88833-8_3"},{"key":"9110_CR27","unstructured":"Jamroga, W., Dix, J.: Model checking ATL ir is indeed $\\Delta_2^P$ -complete. In: Proceedings of EUMAS\u201906 (2006)"},{"issue":"3","key":"9110_CR28","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/s00224-007-9080-z","volume":"42","author":"W. Jamroga","year":"2008","unstructured":"Jamroga, W., Dix, J.: Model checking abilities of agents: a closer look. Theory of Computing Systems, 42(3):366\u2013410, (2008)","journal-title":"Theory of Computing Systems"},{"issue":"2\u20133","key":"9110_CR29","first-page":"185","volume":"63","author":"W. Jamroga","year":"2004","unstructured":"Jamroga, W., van der Hoek W.: Agents that know how to play. Fundam. Inform. 63(2\u20133):185\u2013219 (2004)","journal-title":"Fundam. Inform."},{"key":"9110_CR30","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1007\/11595014_51","volume-title":"Progress in Artificial Intelligence: Proceedings of EPIA 2005","author":"W. Jamroga","year":"2005","unstructured":"Jamroga, W., van der Hoek, W., Wooldridge, M.: Intentions and strategies in game-like scenarios. In: Bento, C., Cardoso, A., Dias, G. (eds.) Progress in Artificial Intelligence: Proceedings of EPIA 2005. Lecture Notes in Artificial Intelligence, vol. 3808, pp. 512\u2013523. Springer, New York (2005)"},{"key":"9110_CR31","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/0899-8256(92)90035-Q","volume":"4","author":"D. Koller","year":"1992","unstructured":"Koller, D., Megiddo, N.: The complexity of twoperson zero-sum games in extensive form. Games Econom. Behav. 4, 528\u2013552 (1992)","journal-title":"Games Econom. Behav."},{"key":"9110_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-45315-6_21","volume-title":"Proceedings of FoSSaCS\u201901","author":"F. Laroussinie","year":"2001","unstructured":"Laroussinie, F., Markey, N., Schnoebelen Ph.: Model checking CTL+ and FCTL is hard. In: Proceedings of FoSSaCS\u201901. Lecture Notes in Computer Science, vol. 2030, pp. 318\u2013331. Springer, New York (2001)"},{"key":"9110_CR33","unstructured":"Andreu Mas-Colell, Michael Whinston, D., Jerry Green, R.: Microeconomic Theory. Oxford (1995)"},{"issue":"6","key":"9110_CR34","first-page":"533","volume":"14","author":"Y. Moses","year":"1995","unstructured":"Moses, Y., Tennenholz, M.: Artificial social systems. Comput. Artif. Intell. 14(6), 533\u2013562 (1995)","journal-title":"Comput. Artif. Intell."},{"key":"9110_CR35","volume-title":"A Course in Game Theory","author":"M. Osborne","year":"1994","unstructured":"Osborne, M., Rubinstein, A.: A Course in Game Theory. MIT, Cambridge (1994)"},{"key":"9110_CR36","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison Wesley, Reading (1994)"},{"key":"9110_CR37","first-page":"201","volume-title":"Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence","author":"W. Tuomas Sandholm","year":"1999","unstructured":"Tuomas Sandholm, W.: Distributed rational decision making. In: Gerhard Weiss (ed.) Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence, pp. 201\u2013258. MIT, Cambridge, MA, USA (1999)"},{"issue":"2","key":"9110_CR38","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/S1571-0661(05)82604-0","volume":"85","author":"P.Y. Schobbens","year":"2004","unstructured":"Schobbens, P.Y.: Alternating-time logic with imperfect recall. Electronic Notes in Theoretical Computer Science, 85(2), 82\u201393 (2004)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"9110_CR39","unstructured":"Shoham, Y., Tennenholz, M.: On the synthesis of useful social laws for artificial agent societies. In: Proceedings of AAAI-92 (1992)"},{"key":"9110_CR40","volume-title":"Bargaining Theory","author":"I. St\u00e5hl","year":"1972","unstructured":"St\u00e5hl, I.: Bargaining Theory. Stockholm School of Economics, Stockholm (1972)"},{"issue":"1","key":"9110_CR41","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01079205","volume":"37","author":"R. Stalnaker","year":"1994","unstructured":"Stalnaker, R.: On the evaluation of solution concepts. Theory Decis. 37(1), 49\u201373 (1994)","journal-title":"Theory Decis."},{"key":"9110_CR42","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1017\/S0266267100004132","volume":"12","author":"R. Stalnaker","year":"1996","unstructured":"Stalnaker, R.: Knowledge, belief and counterfactual reasoning in games. Econ. Philos. 12, 133\u2013163 (1996)","journal-title":"Econ. Philos."},{"key":"9110_CR43","first-page":"149","volume-title":"Proceedings of AAMAS\u201905","author":"K. Su","year":"2005","unstructured":"Su, K., Sattar, A., Governatori, G., Chen, Q.: A computationally grounded logic of knowledge, belief and certainty. In: Proceedings of AAMAS\u201905, pp. 149\u2013156. ACM, New York (2005)"},{"key":"9110_CR44","unstructured":"van Benthem, J.: Rational dynamics and epistemic logic in games. In: Vannucci, S. (ed.) Logic, Game Theory and Social Choice III, pp. 19\u201323 (2003)"},{"key":"9110_CR45","doi-asserted-by":"crossref","unstructured":"van der Hoek, W., Jamroga, W., Wooldridge, M.: A logic for strategic reasoning. In: Proceedings of AAMAS\u201905, pp. 157\u2013164 (2005)","DOI":"10.1145\/1082473.1082497"},{"issue":"1","key":"9110_CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11229-006-9072-6","volume":"156","author":"W. Hoek van der","year":"2005","unstructured":"van der Hoek, W., Roberts, M., Wooldridge, M.: Social laws in alternating time: Effectiveness, feasibility and synthesis. Synthese 156(1), 1\u201319 (2005)","journal-title":"Synthese"},{"key":"9110_CR47","first-page":"1167","volume-title":"Proceedings of the First International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-02)","author":"W. Hoek van der","year":"2002","unstructured":"van der Hoek, W., Wooldridge, M.: Tractable multiagent planning for epistemic goals. In: Castelfranchi, C., Johnson, W.L. (eds.) Proceedings of the First International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-02), pp. 1167\u20131174. ACM, New York (2002)"},{"key":"9110_CR48","unstructured":"van Otterloo, S., Jonker, G.: On epistemic temporal strategic logic. In: Proceedings of LCMAS\u201904. Electronic Notes in Theoretical Computer Science, vol. XX, pp. 35\u201345 (2004)"},{"key":"9110_CR49","unstructured":"van Otterloo, S., Roy, O.: Verification of voting protocols. Working paper, University of Amsterdam (2005)"},{"key":"9110_CR50","unstructured":"van Otterloo, S., van der Hoek, W., Wooldridge, M.: Preferences in game logics. Preliminary version, unpublished manuscript (2004)"},{"key":"9110_CR51","doi-asserted-by":"crossref","unstructured":"van Otterloo, S., van der Hoek, W., Wooldridge, M.: Preferences in game logics. In: Proceedings of AAMAS-04, pp. 152\u2013159 (2004)","DOI":"10.1016\/S1571-0661(05)82608-8"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-009-9110-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-009-9110-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-009-9110-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T19:52:26Z","timestamp":1684871546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-009-9110-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":51,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["9110"],"URL":"https:\/\/doi.org\/10.1007\/s10472-009-9110-4","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}