{"type":"ScholarlyArticle","title":"Reachability Games in Dynamic Epistemic Logic","authors":[{"name":"Bastien Maubert","slug":"bastien-maubert","given":"Bastien","family":"Maubert","affiliation":"Università degli Studi di Napoli \"Federico II\" , Italy"},{"name":"Sophie Pinchinat","slug":"sophie-pinchinat","given":"Sophie","family":"Pinchinat","affiliation":"Univ Rennes , CNRS , IRISA , France"},{"name":"François Schwarzentruber","slug":"francois-schwarzentruber","given":"François","family":"Schwarzentruber","affiliation":"Univ Rennes , CNRS , IRISA , France"}],"abstract":"We define reachability games based on Dynamic Epistemic Logic (DEL), where the players? actions are finely described as DEL action models. We first consider the setting where a controller with perfect information interacts with an environment and aims at reaching some desired state of knowledge regarding the observers of the system. We study the problem of existence of a strategy for the controller, which generalises the classic epistemic planning problem, and we solve it for several types of actions such as public announcements and public actions. We then consider a yet richer setting where observers themselves are players, whose strategies must be based on their observations. We establish several decidability and undecidability results for the problem of existence of a distributed strategy, depending on the type of actions the players can use, and relate them to results from the literature on multiplayer games with imperfect information.","doi":"10.24963/ijcai.2019/71","url":"https://ijcai.org/proceedings/2019/71","pdf":"https://ijcai.org/proceedings/2019/0071.pdf","markdown":"https://ijcai.org/proceedings/2019/71.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/71","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":"Agent-based and Multi-agent Systems","track":"Main track","number":71,"pages":{"first":499,"last":505},"keywords":["Planning and Scheduling: Theoretical Foundations of Planning","Planning and Scheduling: Distributed;Multi-agent Planning","Agent-based and Multi-agent Systems: Formal Verification, Validation and Synthesis","Agent-based and Multi-agent Systems: Multi-agent Planning","Knowledge Representation and Reasoning: Non-classical Logics for Knowledge Representation"],"videos":[],"references":[{"position":1,"raw":"K.R. Apt and E. Grädel. Lectures in game theory for computer scientists. Cambridge UP, 2011.","title":"Lectures in game theory for computer scientists","authors":"K R Apt, E Grädel","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Aucher et al., 2014] G. Aucher, B. Maubert, and S. Pinchi- nat. Automata techniques for epistemic protocol synthesis. In SR'14, pages 97-103, 2014.","title":"Automata techniques for epistemic protocol synthesis","authors":"G Aucher, B Maubert, S Pinchinat","year":"2014","venue":"SR'14","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baffier et al., 2016] J.F. Baffier, M.K. Chiu, Y. Diez, M. Ko- rman, V. Mitsou, A. Van Renssen, M. Roeloffzen, and Y. Uno. Hanabi is np-hard, even for cheaters who look at their cards. arXiv preprint arXiv:1603.01911, 2016.","title":"Hanabi is np-hard, even for cheaters who look at their cards","authors":"J F Baffier, M K Chiu, Y Diez, M Korman, V Mitsou, A Van Renssen, M Roeloffzen, Y Uno","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Baltag et al., 1998] A. Baltag, L. S Moss, and S. Solecki. The logic of public announcements, common knowledge, and private suspicions. In TARK'98, pages 43-56, 1998.","title":"The logic of public announcements, common knowledge, and private suspicions","authors":"A Baltag, L S Moss, S Solecki","year":"1998","venue":"TARK'98","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Belardinelli et al., 2017a] F. Belardinelli, A. Lomuscio, A. Murano, and S. Rubin. Verification of broadcasting multi-agent systems against an epistemic strategy logic. In IJCAI'17, pages 91-97, 2017.","title":"Verification of broadcasting multi-agent systems against an epistemic strategy logic","authors":"Belardinelli","year":"2017","venue":"IJCAI'17","doi":null,"url":null,"internal_url":"/proceedings/2017/14"},{"position":6,"raw":"[Belardinelli et al., 2017b] F. Belardinelli, A. Lomuscio, A. Murano, and S. Rubin. Verification of multi-agent sys- tems with imperfect information and public actions. In AAMAS'17, 2017.","title":"Verification of multi-agent systems with imperfect information and public actions","authors":"Belardinelli","year":"2017","venue":"AAMAS'17","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), 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":"[Blumensath and Grädel, 2000] A. Blumensath and E. Grädel. Automatic structures. In LICS'00, pages 51-62, 2000.","title":"Automatic structures","authors":"A Blumensath, E Grädel","year":"2000","venue":"LICS'00","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bolander and Andersen, 2011] T. Bolander and M.B. An- dersen. Epistemic planning for single and multi-agent sys- tems. J. Appl. Non-Class. Log., 21(1):9-34, 2011.","title":"Epistemic planning for single and multi-agent systems","authors":"T Bolander, M B","year":"2011","venue":"J. Appl. Non-Class. Log","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Bolander et al., 2015] T. Bolander, M.H. Jensen, and F. Schwarzentruber. Complexity results in epistemic plan- ning. In IJCAI, pages 2791-2797, 2015.","title":"Complexity results in epistemic planning","authors":"T Bolander, M H Jensen, F Schwarzentruber","year":"2015","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/395"},{"position":11,"raw":"[Bouyer, 2018] P. Bouyer. Games on graphs with a public signal monitoring. In FOSSACS'18. Springer, 2018.","title":"Games on graphs with a public signal monitoring","authors":"P Bouyer","year":"2018","venue":"FOSSACS'18","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Bozzelli et al., 2015] L. Bozzelli, B. Maubert, and S. Pinchinat. Uniform strategies, rational relations and jumping automata. Inf. Comput., 242:80-107, 2015.","title":"Uniform strategies, rational relations and jumping automata","authors":"L Bozzelli, B Maubert, S Pinchinat","year":"2015","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Chandra and Stockmeyer, 1976] A.K. Chandra and L.J. Stockmeyer. Alternation. In FOCS'76, 1976.","title":"Alternation","authors":"A K Chandra, L J Stockmeyer","year":"1976","venue":"FOCS'76","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Charrier, 2018] T. Charrier. Theoretical complexity of rea- soning in dynamic epistemic logic and symbolic approach. PhD thesis, Université de Rennes 1, 2018.","title":"Theoretical complexity of reasoning in dynamic epistemic logic and symbolic approach","authors":"T Charrier","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Coulombe and Lynch, 2018] M. J. Coulombe and J. Lynch. Cooperating in video games? impossible! undecidability of team multiplayer games. In FUN'18, pages 14:1-14:16, 2018.","title":"Cooperating in video games? impossible! undecidability of team multiplayer games","authors":"M J Coulombe, J Lynch","year":"2018","venue":"FUN'","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Douéneau-Tabot et al., 2018] G. Douéneau-Tabot, S. Pinchinat, and F. Schwarzentruber. Chain-monadic second order logic over regular automatic trees and epistemic planning synthesis. In AiML'18, 2018.","title":"Chain-monadic second order logic over regular automatic trees and epistemic planning synthesis","authors":"G Douéneau-Tabot, S Pinchinat, F Schwarzentruber","year":"2018","venue":"AiML'","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Engesser et al., 2017] T. Engesser, T. Bolander, R. Mattmüller, and B. Nebel. Cooperative epistemic multi-agent planning for implicit coordination. In M4M, pages 75-90, 2017.","title":"Cooperative epistemic multi-agent planning for implicit coordination","authors":"T Engesser, T Bolander, R Mattmüller, B Nebel","year":"2017","venue":"M4M","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Engesser et al., 2018] T. Engesser, R. Mattmüller, B. Nebel, and M. Thielscher. Game description language and dy- namic epistemic logic compared. In IJCAI'18, pages 1795-1802, 2018.","title":"Game description language and dynamic epistemic logic compared","authors":"T Engesser, R Mattmüller, B Nebel, M Thielscher","year":"2018","venue":"IJCAI'18","doi":null,"url":null,"internal_url":"/proceedings/2018/248"},{"position":19,"raw":"[Fagin et al., 1995] R. Fagin, J.Y. Halpern, Y. Moses, and M.Y. Vardi. Reasoning about Knowledge. MIT Press, 1995.","title":"Reasoning about Knowledge","authors":"R Fagin, J Y Halpern, Y Moses, M Y Vardi","year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Geffner and Bonet, 2013] Hector Geffner and Blai Bonet. A concise introduction to models and methods for automated planning. Synthesis Lectures on Artificial Intelligence and Machine Learning, 8(1):1-141, 2013.","title":"A concise introduction to models and methods for automated planning","authors":"Bonet Geffner, Hector Geffner, Blai Bonet","year":"2013","venue":"Synthesis Lectures on Artificial Intelligence and Machine Learning","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Harel and Pnueli, 1985] D. Harel and A. Pnueli. On the de- velopment of reactive systems. In Logics and models of concurrent systems, pages 477-498. Springer, 1985.","title":"On the development of reactive systems","authors":"D Harel, A Pnueli","year":"1985","venue":"Logics and models of concurrent systems","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Lê Cong et al., 2018] S. Lê Cong, S. Pinchinat, and F. Schwarzentruber. Small undecidable problems in epis- temic planning. In IJCAI'18, 2018.","title":"Small undecidable problems in epistemic planning","authors":"S Lê Cong, S Pinchinat, F Schwarzentruber","year":"2018","venue":"IJCAI'18","doi":null,"url":null,"internal_url":"/proceedings/2018/664"},{"position":23,"raw":"T. De Lima. Alternating-time temporal dy- namic epistemic logic. J. Log. Comput., 24(6):1145-1178, 2014.","title":"Alternating-time temporal dynamic epistemic logic","authors":"T De Lima","year":"2014","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Littman et al., 1998] M.L. Littman, J. Goldsmith, and M. Mundhenk. The computational complexity of proba- bilistic planning. J. Artif. Intell. Res., 9:1-36, 1998.","title":"The computational complexity of probabilistic planning","authors":"M L Littman, J Goldsmith, M Mundhenk","year":"1998","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Matros, 2018] A. Matros. Lloyd shapley and chess with imperfect information. Games and Economic Behavior, 108:600-613, 2018.","title":"Lloyd shapley and chess with imperfect information","authors":"A Matros","year":"2018","venue":"Games and Economic Behavior","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Maubert and Murano, 2018] B. Maubert and A. Murano. Reasoning about knowledge and strategies under hierar- chical information. In KR'18, pages 530-540, 2018.","title":"Reasoning about knowledge and strategies under hierarchical information","authors":"B Maubert, A Murano","year":"2018","venue":"KR'","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Maubert et al., 2019] B. Maubert, S. Pinchinat, and F. Schwarzentruber. Reachability games in dynamic epistemic logic. Research Report 1905.12422, arXiv, May 2019.","title":"Reachability games in dynamic epistemic logic","authors":"B Maubert, S Pinchinat, F Schwarzentruber","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Maubert, 2014] B. Maubert. Logical foundations of games with imperfect information : uniform strategies. PhD the- sis, University of Rennes 1, France, 2014.","title":"Logical foundations of games with imperfect information : uniform strategies","authors":"B Maubert","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Peterson and Reif, 1979] G.L. Peterson and J.H. Reif. Multiple-person alternation. In FOCS'79, 1979.","title":"Multiple-person alternation","authors":"G L Peterson, J H Reif","year":"1979","venue":"FOCS'79","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Peterson et al., 2002] G. Peterson, J. Reif, and S. Azhar. Decision algorithms for multiplayer noncooperative games of incomplete information. Computers & Mathe- matics with Applications, 43(1):179-206, 2002.","title":"Decision algorithms for multiplayer noncooperative games of incomplete information","authors":"G Peterson, J Reif, S Azhar","year":"2002","venue":"Computers & Mathematics with Applications","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Pnueli and Rosner, 1990] A. Pnueli and R. Rosner. Dis- tributed reactive systems are hard to synthesize. In FOCS'90, pages 746-757, 1990.","title":"Distributed reactive systems are hard to synthesize","authors":"A Pnueli, R Rosner","year":"1990","venue":"FOCS'90","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Ramanujam and Simon, 2010] R. Ramanujam and S. Si- mon. A communication based model for games of imper- fect information. In CONCUR'10, pages 509-523, 2010.","title":"A communication based model for games of imperfect information","authors":"R Ramanujam, S Simon","year":"2010","venue":"CONCUR'10","doi":null,"url":null,"internal_url":null},{"position":33,"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":34,"raw":"[Rintanen, 2004] J. Rintanen. Complexity of planning with partial observability. In ICAPS'04, pages 345-354, 2004.","title":"Complexity of planning with partial observability","authors":"J Rintanen","year":"2004","venue":"ICAPS'04","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Van Benthem, 2001] J. Van Benthem. Games in dynamic- epistemic logic. Bulletin of Economic Research, 53(4):219-248, 2001.","title":"Games in dynamicepistemic logic","authors":"J Van Benthem","year":"2001","venue":"Bulletin of Economic Research","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[van Ditmarsch et al., 2008] H. van Ditmarsch, W. van der Hoek, and B. Kooi. Dynamic Epistemic Logic. Springer, Dordecht, 2008.","title":"Dynamic Epistemic Logic","authors":"H Van Ditmarsch, W Van Der Hoek, B Kooi","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Yu et al., 2013] Q. Yu, X. Wen, and Y. Liu. Multi-agent epistemic explanatory diagnosis via reasoning about ac- tions. In IJCAI'13, 2013.","title":"Multi-agent epistemic explanatory diagnosis via reasoning about actions","authors":"Q Yu, X Wen, Y Liu","year":"2013","venue":"IJCAI'13","doi":null,"url":null,"internal_url":"/proceedings/2013/178"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}