{"type":"ScholarlyArticle","title":"Reasoning about Quality and Fuzziness of Strategic Behaviours","authors":[{"name":"Patricia Bouyer","slug":"patricia-bouyer","given":"Patricia","family":"Bouyer","affiliation":"LSV , CNRS & ENS Paris-Saclay , Univ. Paris-Saclay , France"},{"name":"Orna Kupferman","slug":"orna-kupferman","given":"Orna","family":"Kupferman","affiliation":"Hebrew University , Israel"},{"name":"Nicolas Markey","slug":"nicolas-markey","given":"Nicolas","family":"Markey","affiliation":"Irisa , CNRS & Inria & Univ. Rennes , France"},{"name":"Bastien Maubert","slug":"bastien-maubert","given":"Bastien","family":"Maubert","affiliation":"Università degli Studi di Napoli \"Federico II\" , Italy"},{"name":"Aniello Murano","slug":"aniello-murano","given":"Aniello","family":"Murano","affiliation":"Università degli Studi di Napoli \"Federico II\" , Italy"},{"name":"Giuseppe Perelli","slug":"giuseppe-perelli","given":"Giuseppe","family":"Perelli","affiliation":"University of Leicester , UK"}],"abstract":"We introduce and study SL[F], a quantitative extension of SL (Strategy Logic), one of the most natural and expressive logics describing strategic behaviours. The satisfaction value of an SL[F] formula is a real value in [0,1], reflecting ``how much'' or ``how well'' the strategic on-going objectives of the underlying agents are satisfied. We demonstrate the applications of SL[F] in quantitative reasoning about multi-agent systems, by showing how it can express concepts of stability in multi-agent systems, and how it generalises some fuzzy temporal logics. We also provide a model-checking algorithm for ourlogic, based on a quantitative extension of Quantified CTL*.","doi":"10.24963/ijcai.2019/220","url":"https://ijcai.org/proceedings/2019/220","pdf":"https://ijcai.org/proceedings/2019/0220.pdf","markdown":"https://ijcai.org/proceedings/2019/220.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/220","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":220,"pages":{"first":1588,"last":1594},"keywords":["Knowledge Representation and Reasoning: Preference Modelling and Preference-Based Reasoning","Agent-based and Multi-agent Systems: Formal Verification, Validation and Synthesis"],"videos":[],"references":[{"position":1,"raw":"[Alechina et al., 2010] N. Alechina, B. Logan, N. Nguyen Hoang, and A. Rakib. Resource-bounded alternating-time temporal logic. AAMAS'10, p. 481-488.","title":"Resource-bounded alternating-time temporal logic","authors":"N Alechina, B Logan, N Nguyen Hoang, A Rakib","year":null,"venue":"AAMAS'10","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Almagor et al., 2014] S. Almagor, U. Boker, and O. Kupferman. Discounting in LTL. TACAS'14, LNCS 8413, p. 424-439. Springer.","title":"Discounting in LTL","authors":"S Almagor, U Boker, O Kupferman","year":null,"venue":"TACAS'14","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Almagor et al., 2016] S. Almagor, U. Boker, and O. Kupferman. Formally reasoning about quality. J.ACM, 63(3):24:1-24:56.","title":"Formally reasoning about quality","authors":"S Almagor, U Boker, O Kupferman","year":null,"venue":"J.ACM","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Almagor et al., 2017] S. Almagor, O. Kupferman, J. Ringert, and Y. Velner. Quantitative assume guarantee synthesis. CAV'17, LNCS 10427, p. 353-374. Springer.","title":"Quantitative assume guarantee synthesis","authors":"S Almagor, O Kupferman, J Ringert, Y Velner","year":null,"venue":"CAV'17","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Almagor et al., 2018] S. Almagor, O. Kupferman, and G. Perelli. Synthesis of controllable Nash equilibria in quantitative objective games. IJCAI'18, p. 35-41.","title":"Synthesis of controllable Nash equilibria in quantitative objective games","authors":"S Almagor, O Kupferman, G Perelli","year":null,"venue":"IJCAI'18","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Alur et al., 2002] R. Alur, T. Henzinger, and O. Kupferman. Alternating-time temporal logic. J.ACM, 49(5):672-713.","title":"Alternating-time temporal logic","authors":"R Alur, T Henzinger, O Kupferman","year":null,"venue":"J.ACM","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Berthon et al., 2017] R. Berthon, B. Maubert, A. Murano, S. Ru- bin, and M. Y. Vardi. Strategy logic with imperfect information. LICS'17, p. 1-12.","title":"Strategy logic with imperfect information","authors":"R Berthon, B Maubert, A Murano, S Rubin, M Y Vardi","year":null,"venue":"LICS","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Boker et al., 2014] U. Boker, K. Chatterjee, T. Henzinger, and O. Kupferman. Temporal specifications with accumulative val- ues. ACM ToCL, 15(4):27:1-27:25.","title":"Temporal specifications with accumulative values","authors":"U Boker, K Chatterjee, T Henzinger, O Kupferman","year":null,"venue":"ACM ToCL","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bollig et al., 2012] B. Bollig, N. Decker, and M. Leucker. Fre- quency linear-time temporal logic. TASE'12, p. 85-92. IEEE.","title":"Frequency linear-time temporal logic","authors":"B Bollig, N Decker, M Leucker","year":null,"venue":"TASE'","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Bouyer et al., 2008] P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey, and J. Srba. Infinite runs in weighted timed automata with energy constraints. FORMATS'08, LNCS 5215, p. 33-47. Springer.","title":"Infinite runs in weighted timed automata with energy constraints","authors":"P Bouyer, U Fahrenberg, K G Larsen, N Markey, J Srba","year":null,"venue":"FORMATS'08","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Bouyer et al., 2014] P. Bouyer, N. Markey, and R. M. Mat- teplackel. Averaging in LTL. CONCUR'14, LNCS 8704, p. 266- 280. Springer.","title":"Averaging in LTL","authors":"P Bouyer, N Markey, R M","year":null,"venue":"CONCUR'14","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Bouyer et al., 2015] P. Bouyer, P. Gardy, and N. Markey. Weighted strategy logic with boolean goals over one-counter games. FSTTCS'15, LIPIcs 45, p. 69-83. LZI.","title":"Weighted strategy logic with boolean goals over one-counter games","authors":"P Bouyer, P Gardy, N Markey","year":null,"venue":"FSTTCS","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Bouyer et al., 2019] P. Bouyer, O. Kupferman, N. Markey, B. Maubert, A. Murano, and G. Perelli. Reasoning about qual- ity and fuzziness of strategic behaviours. Research Report 1905.11537, arXiv.","title":"Reasoning about quality and fuzziness of strategic behaviours","authors":"P Bouyer, O Kupferman, N Markey, B Maubert, A Murano, G Perelli","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Brenguier et al., 2016] R. Brenguier, G. Pérez, J.-F. Raskin, and M. Sassolas. Admissibility in quantitative graph games. FSTTCS'16, LIPIcs 65, p. 42:1-42:14. LZI. Bruyère et al., 2014]","title":"Admissibility in quantitative graph games","authors":"R Brenguier, G Pérez, J.-F Raskin, M Sassolas","year":"2014","venue":"FSTTCS'16","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"V. Bruyère, N. Meunier, and J.-F. Raskin. Se- cure equilibria in weighted games. CSL/LICS'14, p. 26:1-26:26. ACM. Bulling and Goranko, 2013]","title":"Secure equilibria in weighted games","authors":"V Bruyère, N Meunier, J.-F Raskin","year":"2013","venue":"CSL/LICS'14","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"N. Bulling and V. Goranko. How to be both rich and happy: Combining quantitative and qualitative strategic reasoning about multi-player games (extended abstract). SR'13, EPTCS 112, p. 33-41.","title":"How to be both rich and happy: Combining quantitative and qualitative strategic reasoning about multi-player games (extended abstract)","authors":"N Bulling, V Goranko","year":null,"venue":"EPTCS","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Chatterjee et al., 2006] K. Chatterjee, T. Henzinger, and M. Jur- dziński. Games with secure equilibria. TCS, 365(1-2):67-82.","title":"Games with secure equilibria","authors":"K Chatterjee, T Henzinger, M Jurdziński","year":null,"venue":"TCS","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Chockler et al., 2006] H. Chockler, O. Kupferman, and M. Y. Vardi. Coverage metrics for formal verification. STTT, 8(4- 5):373-386.","title":"Coverage metrics for formal verification","authors":"H Chockler, O Kupferman, M Y Vardi","year":null,"venue":"STTT","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Cole et al., 2006] R. Cole, Y. Dodis, and T. Roughgarden. How much can taxes help selfish routing? JCSS, 72(3):444-467.","title":"How much can taxes help selfish routing?","authors":"R Cole, Y Dodis, T Roughgarden","year":null,"venue":"JCSS","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Della Monica and Murano, 2018] D. Della Monica and A. Mu- rano. Parity-energy ATL for qualitative and quantitative reason- ing in MAS. AAMAS'18, p. 1441-1449. [Ehrenfeucht and Mycielski, 1979]","title":"Parity-energy ATL for qualitative and quantitative reasoning in MAS","authors":"D, Della Monica, A Murano","year":"1979","venue":"AAMAS'18","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"A. Ehrenfeucht and J. Myciel- ski. Positional strategies for mean payoff games. IJGT, 8(2):109- 113.","title":"Positional strategies for mean payoff games","authors":"A Ehrenfeucht, J Mycielski","year":null,"venue":"IJGT","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Emerson and Halpern, 1986] A. Emerson and J. Halpern. \"Some- times\" and \"not never\" revisited: On branching versus linear time temporal logic. J.ACM, 33(1):151-178.","title":"Sometimes\" and \"not never\" revisited: On branching versus linear time temporal logic","authors":"A Emerson, J Halpern","year":null,"venue":"J.ACM","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Emerson and Jutla, 1991] A. Emerson and C. Jutla. Tree automata, mu-calculus and determinacy. FOCS'91, p. 368-377. IEEE.","title":"Tree automata, mu-calculus and determinacy","authors":"A Emerson, C Jutla","year":null,"venue":"FOCS'91","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Emerson and Lei, 1987] E. A. Emerson and C.-L. Lei. Modalities for model checking: Branching time logic strikes back. SCP, 8:275-306.","title":"Modalities for model checking: Branching time logic strikes back","authors":"E A Emerson, C.-L Lei","year":null,"venue":"SCP","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Fijalkow et al., 2018] N. Fijalkow, B. Maubert, A. Murano, and S. Rubin. Quantifying bounds in strategy logic. CSL'18, LIPIcs 119, p. 23:1-23:23. LZI.","title":"Quantifying bounds in strategy logic","authors":"N Fijalkow, B Maubert, A Murano, S Rubin","year":null,"venue":"LIPIcs","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Frigeri et al., 2014] A. Frigeri, L. Pasquale, and P. Spoletini. Fuzzy time in linear temporal logic. ACM ToCL, 15(4):30.","title":"Fuzzy time in linear temporal logic","authors":"A Frigeri, L Pasquale, P Spoletini","year":null,"venue":"ACM ToCL","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Gutierrez et al., 2017] J. Gutierrez, A. Murano, G. Perelli, S. Ru- bin, and M. Wooldridge. Nash equilibria in concurrent games with lexicographic preferences. IJCAI'17, p. 1067-1073.","title":"Nash equilibria in concurrent games with lexicographic preferences","authors":"J Gutierrez, A Murano, G Perelli, S Rubin, M Wooldridge","year":null,"venue":"IJCAI'17","doi":null,"url":null,"internal_url":"/proceedings/2017/148"},{"position":28,"raw":"[Hartline and Roughgarden, 2008] J. D. Hartline and T. Roughgar- den. Optimal mechanism design and money burning. STOC'08, p. 75-84.","title":"Optimal mechanism design and money burning","authors":"J D Hartline, T Roughgarden","year":null,"venue":"STOC","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Jamroga et al., 2016] W. Jamroga, B. Konikowska, and W. Penczek. Multi-valued verification of strategic ability. AAMAS'16, p. 1180-1189.","title":"Multi-valued verification of strategic ability","authors":"W Jamroga, B Konikowska, W Penczek","year":null,"venue":"AAMAS'16","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Kupferman and Vardi, 2005] O. Kupferman and M. Y. Vardi. Safraless decision procedures. FOCS'05, p. 531-540.","title":"Safraless decision procedures","authors":"O Kupferman, M Y Vardi","year":null,"venue":"FOCS'05","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Kupferman et al., 2000] O. Kupferman, M. Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model-checking. J.ACM, 47(2):312-360.","title":"An automata-theoretic approach to branching-time model-checking","authors":"O Kupferman, M Y Vardi, P Wolper","year":null,"venue":"J.ACM","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Kupferman et al., 2016] O. Kupferman, G. Perelli, and M. Y. Vardi. Synthesis with rational environments. Ann. Math. Artif. Intell., 78(1):3-20.","title":"Synthesis with rational environments","authors":"O Kupferman, G Perelli, M Y Vardi","year":null,"venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Lamine and Kabanza, 2000] K. Lamine and F. Kabanza. Us- ing fuzzy temporal logic for monitoring behavior-based mobile robots. Robotics and Applications, p. 116-121.","title":"Using fuzzy temporal logic for monitoring behavior-based mobile robots","authors":"K Lamine, F Kabanza","year":null,"venue":"Robotics and Applications","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Laroussinie and Markey, 2014] F. Laroussinie and N. Markey. Quantified CTL: Expressiveness and complexity. LMCS, 10(4).","title":"Quantified CTL: Expressiveness and complexity","authors":"F Laroussinie, N Markey","year":null,"venue":"LMCS","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Laroussinie and Markey, 2015] F. Laroussinie and N. Markey. Augmenting ATL with strategy contexts. I.&C., 245:98-123.","title":"Augmenting ATL with strategy contexts","authors":"F Laroussinie, N Markey","year":null,"venue":"I.&C","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Laroussinie et al., 2006] F. Laroussinie, N. Markey, and G. Or- eiby. Model-checking timed ATL for durational concurrent game structures. FORMATS'06, LNCS 4202, p. 245-259. Springer.","title":"Model-checking timed ATL for durational concurrent game structures","authors":"F Laroussinie, N Markey, G Oreiby","year":null,"venue":"FORMATS'06","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Mogavero et al., 2014] F. Mogavero, A. Murano, G. Perelli, and M. Y. Vardi. Reasoning about strategies: On the model-checking problem. ACM ToCL, 15(4):34:1-34:47.","title":"Reasoning about strategies: On the model-checking problem","authors":"F Mogavero, A Murano, G Perelli, M Y Vardi","year":null,"venue":"ACM ToCL","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Nisan et al., 2007] N. Nisan, T. Roughgarden, É. Tardos, and V. Vazirani. Algorithmic Game Theory. CUP.","title":"Algorithmic Game Theory","authors":"N Nisan, T Roughgarden, É Tardos, V Vazirani","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Pnueli and Rosner, 1989] A. Pnueli and R. Rosner. On the synthe- sis of a reactive module. POPL'89, p. 179-190.","title":"On the synthesis of a reactive module","authors":"Rosner Pnueli, ] A Pnueli, R Rosner","year":"1989","venue":"POPL'89","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Pnueli, 1981] A. Pnueli. The temporal semantics of concurrent programs. TCS, 13:45-60.","title":"The temporal semantics of concurrent programs","authors":"A Pnueli","year":null,"venue":"TCS","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Souza and Rego, 2016] F. Souza and L. C. Rego. Mixed equilib- rium in 2 × 2 normal form games: when burning money is ratio- nal. Pesqui. Oper., 36(1):81-99.","title":"Mixed equilibrium in 2 × 2 normal form games: when burning money is rational","authors":"F Souza, L C Rego","year":null,"venue":"Pesqui. Oper","doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Vester, 2015] S. Vester. On the complexity of model-checking branching and alternating-time temporal logics in one-counter systems. ATVA'15, LNCS 9364, p. 361-377. Springer.","title":"On the complexity of model-checking branching and alternating-time temporal logics in one-counter systems","authors":"S Vester","year":"9364","venue":"ATVA'15","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}