{"type":"ScholarlyArticle","title":"Some Things are Easier for the Dumb and the Bright Ones (Beware the Average!)","authors":[{"name":"Wojciech Jamroga","slug":"wojciech-jamroga","given":"Wojciech","family":"Jamroga","affiliation":"Institute of Computer Science , Polish Academy of Sciences , Warsaw , Poland; Interdisciplinary Centre for Security, Reliability and Trust , SnT , University of Luxembourg"},{"name":"Michał Knapik","slug":"micha-knapik","given":"Michał","family":"Knapik","affiliation":"Institute of Computer Science , Polish Academy of Sciences , Warsaw , Poland"}],"abstract":"Model checking strategic abilities in multi-agent systems is hard, especially for agents with partial observability of the state of the system. In that case, it ranges from NP-complete to undecidable, depending on the precise syntax and the semantic variant. That, however, is the worst case complexity, and the problem might as well be easier when restricted to particular subclasses of inputs. In this paper, we look at the verification of models with \"extreme\" epistemic structure, and identify several special cases for which model checking is easier than in general. We also prove that, in the other cases, no gain is possible even if the agents have almost full (or almost nil) observability. To prove the latter kind of results, we develop generic techniques that may be useful also outside of this study.","doi":"10.24963/ijcai.2019/240","url":"https://ijcai.org/proceedings/2019/240","pdf":"https://ijcai.org/proceedings/2019/0240.pdf","markdown":"https://ijcai.org/proceedings/2019/240.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/240","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":240,"pages":{"first":1734,"last":1740},"keywords":["Agent-based and Multi-agent Systems: Agent Theories and Models","Agent-based and Multi-agent Systems: Formal Verification, Validation and Synthesis","Knowledge Representation and Reasoning: Computational Complexity of Reasoning"],"videos":[],"references":[{"position":1,"raw":"[Ågotnes and Walther, 2009] T. Ågotnes and D. Walther. A logic of strategic ability under bounded memory. Journal of Logic, Language and Information, 18(1):55-77, 2009.","title":"A logic of strategic ability under bounded memory","authors":"T Ågotnes, D Walther","year":"2009","venue":"Journal of Logic, Language and Information","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Ågotnes et al., 2007] T. Ågotnes, V. Goranko, and W. Jam- roga. Alternating-time temporal logics with irrevocable strategies. In Proceedings of TARK XI, pages 15-24, 2007.","title":"Alternating-time temporal logics with irrevocable strategies","authors":"T Ågotnes, V Goranko, W Jamroga","year":"2007","venue":"Proceedings of TARK XI","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Ågotnes et al., 2015] T. Ågotnes, V. Goranko, W. Jamroga, and M. Wooldridge. Knowledge and ability. In H.P. van Ditmarsch, J.Y. Halpern, W. van der Hoek, and B.P. Kooi, editors, Handbook of Epistemic Logic, pages 543-589. College Publications, 2015.","title":"Knowledge and ability","authors":"T Ågotnes, V Goranko, W Jamroga, M Wooldridge","year":"2015","venue":"Handbook of Epistemic Logic","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Alur et al., 2002] R. Alur, T. A. Henzinger, and O. Kupfer- man. Alternating-time Temporal Logic. Journal of the ACM, 49:672-713, 2002.","title":"Alternating-time Temporal Logic","authors":"R Alur, T A Henzinger, O Kupferman","year":"2002","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Belardinelli et al., 2017] F. Belardinelli, A. Lomuscio, A. Murano, and S. Rubin. Verification of multi-agent sys- tems with imperfect information and public actions. In Proceedings of AAMAS, pages 1268-1276, 2017.","title":"Verification of multi-agent systems with imperfect information and public actions","authors":"F Belardinelli, A Lomuscio, A Murano, S Rubin","year":"2017","venue":"Proceedings of AAMAS","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Berwanger and Kaiser, 2010] D. Berwanger and L. Kaiser. Information tracking in games on graphs. Journal of Logic, Language and Information, 19(4):395-412, 2010.","title":"Information tracking in games on graphs","authors":"D Berwanger, L Kaiser","year":"2010","venue":"Journal of Logic, Language and Information","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Berwanger et al., 2018] D. Berwanger, A. B. Mathew, and M. van den Bogaard. Hierarchical information and the synthesis of distributed strategies. Acta Inf., 55(8):669- 701, 2018.","title":"Hierarchical information and the synthesis of distributed strategies","authors":"D Berwanger, A B Mathew, M Van Den Bogaard","year":"2018","venue":"Acta Inf","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bulling et al., 2010] N. Bulling, J. Dix, and W. Jamroga. Model checking logics of strategic ability: Complexity. In M. Dastani, K. Hindriks, and J.-J. Meyer, editors, Spec- ification and Verification of Multi-Agent Systems, pages 125-159. Springer, 2010.","title":"Model checking logics of strategic ability: Complexity","authors":"N Bulling, J Dix, W Jamroga","year":"2010","venue":"Specification and Verification of Multi-Agent Systems","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Busard, 2017] S. Busard. Symbolic Model Checking of Multi-Modal Logics: Uniform Strategies and Rich Expla- nations. PhD thesis, Universite Catholique de Louvain, 2017.","title":"Symbolic Model Checking of Multi-Modal Logics: Uniform Strategies and Rich Explanations","authors":"S Busard","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Chatterjee et al., 2007] K. Chatterjee, L. Doyen, T.A. Hen- zinger, and J.-F. Raskin. Algorithms for omega-regular games of incomplete information. Logical Methods in Computer Science, 3(3), 2007.","title":"Algorithms for omega-regular games of incomplete information","authors":"K Chatterjee, L Doyen, T A Henzinger, J.-F Raskin","year":"2007","venue":"Logical Methods in Computer Science","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Dima and Tiplea, 2011] C. Dima and F.L. Tiplea. Model- checking ATL under imperfect information and perfect recall semantics is undecidable. CoRR, abs/1102.4225, 2011.","title":"Modelchecking ATL under imperfect information and perfect recall semantics is undecidable","authors":"C Dima, F L Tiplea","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Doyen and Raskin, 2011] L. Doyen and J.-F. Raskin. Games with imperfect information: Theory and algo- rithms. In Lecture Notes in Game Theory for Computer Scientists, pages 185-212. Cambridge University Press, 2011.","title":"Games with imperfect information: Theory and algorithms","authors":"L Doyen, J.-F Raskin","year":"2011","venue":"Lecture Notes in Game Theory for Computer Scientists","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Guelev et al., 2011] D.P. Guelev, C. Dima, and C. Enea. An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking. Jour- nal of Applied Non-Classical Logics, 21(1):93-131, 2011.","title":"An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking","authors":"D P Guelev, C Dima, C Enea","year":"2011","venue":"Journal of Applied Non-Classical Logics","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Huang and van der Meyden, 2014] X. Huang and R. van der Meyden. Symbolic model checking epistemic strategy logic. In Proceedings of AAAI Conference on Artificial Intelligence, pages 1426-1432, 2014.","title":"Symbolic model checking epistemic strategy logic","authors":"Van Huang, ; X Der Meyden, R Huang, Van Der Meyden","year":"2014","venue":"Proceedings of AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Jamroga and Dix, 2006] W. Jamroga and J. Dix. Model checking ATL ir is indeed ∆ P 2 -complete. In Proceedings of EUMAS, volume 223 of CEUR Workshop Proceedings, 2006.","title":"Model checking ATL ir is indeed ∆ P 2 -complete","authors":"W Jamroga, J Dix","year":"2006","venue":"CEUR Workshop Proceedings","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Jamroga and van der Hoek, 2004] W. Jamroga and W. van der Hoek. Agents that know how to play. Fundamenta Informaticae, 63(2-3):185-219, 2004.","title":"Agents that know how to play","authors":"Van Jamroga, ; W Der Hoek, W Jamroga, Van Der Hoek","year":"2004","venue":"Fundamenta Informaticae","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Jamroga et al., 2017] W. Jamroga, M. Knapik, and D. Kurpiewski. Fixpoint approximation of strategic abilities under imperfect information. In Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 1241-1249.","title":"Fixpoint approximation of strategic abilities under imperfect information","authors":"W Jamroga, M Knapik, D Kurpiewski","year":null,"venue":"Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS)","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"IFAAMAS, 2017.","title":null,"authors":"Ifaamas","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Jamroga, 2003] W. Jamroga. Some remarks on alternat- ing temporal epistemic logic. In B. Dunin-Keplicz and R. Verbrugge, editors, Proceedings of Formal Approaches to Multi-Agent Systems (FAMAS 2003), pages 133-140, 2003.","title":"Some remarks on alternating temporal epistemic logic","authors":"W Jamroga","year":"2003","venue":"Proceedings of Formal Approaches to Multi-Agent Systems (FAMAS 2003)","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Laroussinie et al., 2001] F. Laroussinie, N. Markey, and Ph. Schnoebelen. Model checking CTL+ and FCTL is hard. In Proceedings of FoSSaCS'01, volume 2030 of Lecture Notes in Computer Science, pages 318-331. Springer, 2001.","title":"Model checking CTL+ and FCTL is hard","authors":"F Laroussinie, N Markey, Ph Schnoebelen","year":"2001","venue":"Proceedings of FoSSaCS'01","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Maubert and Murano, 2018] Bastien Maubert and Aniello Murano. Reasoning about knowledge and strategies un- der hierarchical information. In Proceedings of KR, pages 530-540, 2018.","title":"Reasoning about knowledge and strategies under hierarchical information","authors":"Murano Maubert, Bastien Maubert, Aniello Murano","year":"2018","venue":"Proceedings of KR","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Peterson and Reif, 1979] G. Peterson and J. Reif. Multiple- person alternation. In Proceedings of the 20th Annual Symposium on Foundations of Computer Science (FOCS), pages 348-363. IEEE Computer Society Press, 1979.","title":"Multipleperson alternation","authors":"G Peterson, J Reif","year":"1979","venue":"Proceedings of the 20th Annual Symposium on Foundations of Computer Science (FOCS)","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Pilecki et al., 2014] J. Pilecki, M.A. Bednarczyk, and W. Jamroga. Synthesis and verification of uniform strate- gies for multi-agent systems. In Proceedings of CLIMA XV, volume 8624 of Lecture Notes in Computer Science, pages 166-182. Springer, 2014.","title":"Synthesis and verification of uniform strategies for multi-agent systems","authors":"J Pilecki, M A Bednarczyk, W Jamroga","year":"2014","venue":"Proceedings of CLIMA XV","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Reif, 1984] John H. Reif. The complexity of two-player games of incomplete information. J. Comput. Syst. Sci., 29(2):274-301, 1984.","title":"The complexity of two-player games of incomplete information","authors":"John H Reif","year":"1984","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Schewe and Finkbeiner, 2007] S. Schewe and B. Finkbeiner. Distributed synthesis for alternating- time logics. In Proceedings of ATVA, volume 4762 of Lecture Notes in Computer Science, pages 268-283.","title":"Distributed synthesis for alternatingtime logics","authors":"S Schewe, B Finkbeiner","year":null,"venue":"Proceedings of ATVA","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Schobbens, 2004] P. Y. Schobbens. Alternating-time logic with imperfect recall. Electronic Notes in Theoretical Computer Science, 85(2):82-93, 2004.","title":"Alternating-time logic with imperfect recall","authors":"P Y Schobbens","year":"2004","venue":"Electronic Notes in Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[van der Hoek et al., 2006] W. van der Hoek, A. Lomuscio, and M. Wooldridge. On the complexity of practical ATL model checking. In Proceedings of International Joint Conference on Autonomous Agents and Multiagent Sys- tems (AAMAS), pages 201-208. ACM, 2006.","title":"On the complexity of practical ATL model checking","authors":"Hoek Van Der","year":"2006","venue":"Proceedings of International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}