Reasoning about Quality and Fuzziness of Strategic Behaviors

We introduce and study SL[F]—a quantitative ex-tension 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 our logic, based on a quantitative extension of Quantified CTL*.

[1]  Patricia Bouyer,et al.  Reasoning About Quality and Fuzziness of Strategic Behaviours , 2020, ECAI.

[2]  Romain Brenguier,et al.  Robust Equilibria in Mean-Payoff Games , 2016, FoSSaCS.

[3]  Patricia Bouyer,et al.  Weighted Strategy Logic with Boolean Goals Over One-Counter Games , 2015, FSTTCS.

[4]  Dario Della Monica,et al.  Parity-energy ATL for Qualitative and Quantitative Reasoning in MAS , 2018, AAMAS.

[5]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 2002, JACM.

[6]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

[7]  Dana Fisman,et al.  Rational Synthesis , 2009, TACAS.

[8]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1999 .

[9]  Orna Kupferman,et al.  Formally Reasoning About Quality , 2016, J. ACM.

[10]  Steen Vester.  On the Complexity of Model-Checking Branching and Alternating-Time Temporal Logics in One-Counter Systems , 2015, ATVA.

[11]  Véronique Bruyère,et al.  Secure equilibria in weighted games , 2014, CSL-LICS.

[12]  Thomas A. Henzinger,et al.  Resource Interfaces , 2003, EMSOFT.

[13]  Orna Kupferman,et al.  Coverage metrics for formal verification , 2003, International Journal on Software Tools for Technology Transfer.

[14]  Michael Wooldridge,et al.  Nash Equilibria in Concurrent Games with Lexicographic Preferences , 2017, IJCAI.

[15]  Orna Kupferman,et al.  Discounting in LTL , 2014, TACAS.

[16]  Aniello Murano,et al.  Reasoning About Strategies: On the Model-Checking Problem , 2011, ArXiv.

[17]  Krishnendu Chatterjee,et al.  Temporal Specifications with Accumulative Values , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[18]  Richard Cole,et al.  How much can taxes help selfish routing? , 2003, EC '03.

[19]  Christel Baier,et al.  Stochastic game logic , 2007, Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007).

[20]  M. Raj Mohan,et al.  Averaging in LTL , 2014, CONCUR.

[21]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[22]  Giuseppe Perelli,et al.  Synthesis of Controllable Nash Equilibria in Quantitative Objective Game , 2018, IJCAI.

[23]  Amir Pnueli,et al.  On the Development of Reactive Systems , 1989, Logics and Models of Concurrent Systems.

[24]  Guillermo A. Pérez,et al.  Admissibility in Quantitative Graph Games , 2016, FSTTCS.

[25]  Joseph Sifakis,et al.  Controller Synthesis for Timed Automata 1 , 1998 .

[26]  Khaled Ben Lamine.  Using fuzzy temporal logic for monitoring behavior-based mobile robots , 2006 .

[27]  Noam Nisan,et al.  Algorithmic Mechanism Design , 2001, Games Econ. Behav..

[28]  Tim Roughgarden,et al.  Optimal mechanism design and money burning , 2008, STOC.

[29]  Aniello Murano,et al.  Concurrent Multi-Player Parity Games , 2016, AAMAS.

[30]  Kim G. Larsen,et al.  Infinite Runs in Weighted Timed Automata with Energy Constraints , 2008, FORMATS.

[31]  Nicolas Markey,et al.  Augmenting ATL with strategy contexts , 2015, Inf. Comput..

[32]  Pierre Wolper,et al.  An automata-theoretic approach to branching-time model checking , 2000, JACM.

[33]  Nicolas Markey,et al.  Timed Concurrent Game Structures , 2007, CONCUR.

[34]  Wojciech Penczek,et al.  Multi-Valued Verification of Strategic Ability , 2016, AAMAS.

[35]  Giuseppe Perelli,et al.  Synthesis with rational environments , 2016, Annals of Mathematics and Artificial Intelligence.

[36]  Jan Oliver Ringert,et al.  Quantitative Assume Guarantee Synthesis , 2017, CAV.

[37]  Aniello Murano,et al.  Strategy logic with imperfect information , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[38]  Nir Piterman.  From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata , 2007, Log. Methods Comput. Sci..

[39]  Jean-François Raskin,et al.  Assume-admissible synthesis , 2015, Acta Informatica.

[40]  Abdur Rakib,et al.  Resource-bounded alternating-time temporal logic , 2010, AAMAS.

[41]  Chin-Laung Lei,et al.  Modalities for Model Checking: Branching Time Logic Strikes Back , 1987, Sci. Comput. Program..

[42]  Y VardiMoshe,et al.  An automata-theoretic approach to branching-time model checking , 2000 .

[43]  Liliana Pasquale,et al.  Fuzzy Time in Linear Temporal Logic , 2014, TOCL.

[44]  Véronique Bruyère,et al.  On Equilibria in Quantitative Games with Reachability/Safety Objectives , 2013, Theory of Computing Systems.

[45]  Dietmar Berwanger,et al.  Admissibility in Infinite Games , 2007, STACS.

[46]  Thomas A. Henzinger,et al.  Model checking discounted temporal properties , 2005, Theor. Comput. Sci..

[47]  Jian Lu,et al.  Probabilistic Alternating-time Temporal Logic and Model Checking Algorithm , 2007, Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007).

[48]  Michael Ummels,et al.  Stochastic multiplayer games: theory and algorithms , 2010 .

[49]  Nicolas Markey,et al.  Quantified CTL: Expressiveness and Complexity , 2014, Log. Methods Comput. Sci..

[50]  Aniello Murano,et al.  Graded modalities in Strategy Logic , 2018, Inf. Comput..

[51]  Aniello Murano,et al.  Quantifying Bounds in Strategy Logic , 2018, CSL.

[52]  Amir Pnueli.  The Temporal Semantics of Concurrent Programs , 1981, Theor. Comput. Sci..

[53]  Richard Cole,et al.  How much can taxes help selfish routing? , 2006, J. Comput. Syst. Sci..

[54]  J. Filar,et al.  Competitive Markov Decision Processes , 1996 .

[55]  Krishnendu Chatterjee,et al.  Doomsday Equilibria for Omega-Regular Games , 2013, VMCAI.

[56]  A. Pnueli,et al.  CONTROLLER SYNTHESIS FOR TIMED AUTOMATA , 2006 .

[57]  Valentin Goranko,et al.  How to Be Both Rich and Happy: Combining Quantitative and Qualitative Strategic Reasoning about Multi-Player Games (Extended Abstract) , 2013, SR.

[58]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[59]  Thomas A. Henzinger,et al.  Timed Alternating-Time Temporal Logic , 2006, FORMATS.

[60]  A. Ehrenfeucht,et al.  Positional strategies for mean payoff games , 1979 .

[61]  Leandro Chaves Rêgo,et al.  MIXED EQUILIBRIUM IN 2 × 2 NORMAL FORM GAMES: WHEN BURNING MONEY IS RATIONAL , 2016 .

[62]  Orna Kupferman,et al.  High-Quality Synthesis Against Stochastic Environments , 2016, CSL.

[63]  Benedikt Bollig,et al.  Frequency Linear-time Temporal Logic , 2012, 2012 Sixth International Symposium on Theoretical Aspects of Software Engineering.

[64]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

[65]  Krishnendu Chatterjee,et al.  Games with secure equilibria , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[66]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[67]  Orna Kupferman,et al.  Safraless decision procedures , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[68]  Nicolas Markey,et al.  Model-Checking Timed , 2006, FORMATS.

[69]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[70]  Aniello Murano,et al.  What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic , 2012, CONCUR.

[71]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .