Expressiveness and Nash Equilibrium in Iterated Boolean Games

We introduce and investigate a novel notion of expressiveness for temporal logics that is based on game theoretic properties of multi-agent systems. We focus on iterated Boolean games, where each agent i has a goal γai, represented using (a fragment of) Linear Temporal Logic (LTL). The goal γai captures agent i's preferences: the models of γi represent system behaviours that would satisfy i, and each player is assumed to act strategically, taking into account the goals of other players, in order to bring about computations satisfying their goal. In this setting, we apply the standard game-theoretic concept of Nash equilibria: the Nash equilibria of an iterated Boolean game can be understood as a (possibly empty) set of computations, each computation representing one way the system could evolve if players chose strategies in Nash equilibrium. Such an equilibrium set of computations can be understood as expressing a temporal property---which may or may not be expressible within a particular LTL fragment. The new notion of expressiveness that we study is then as follows: what LTL properties are characterised by the Nash equilibria of games in which agent goals are expressed in fragments of LTL? We formally define and investigate this notion of expressiveness and some related issues, for a range of LTL fragments.

[1]  Jürgen Dix,et al.  Reasoning about temporal properties of rational play , 2008, Annals of Mathematics and Artificial Intelligence.

[2]  David Banks,et al.  Games and Decisions , 2015 .

[3]  Doron A. Peled,et al.  Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator , 1997, Inf. Process. Lett..

[4]  Moshe Y. Vardi.  Branching vs. Linear Time: Final Showdown , 2001, TACAS.

[5]  Antonín Kucera,et al.  The stuttering principle revisited , 2005, Acta Informatica.

[6]  Pierre Wolper,et al.  Reasoning About Infinite Computations , 1994, Inf. Comput..

[7]  Ludwig Staiger,et al.  Ω-languages , 1997 .

[8]  Philippe Schnoebelen,et al.  The Complexity of Propositional Linear Temporal Logics in Simple Cases , 1998, Inf. Comput..

[9]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[10]  Wolfgang Thomas,et al.  Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics , 1990 .

[11]  Leslie Lamport,et al.  Specifying Concurrent Program Modules , 1983, TOPL.

[12]  Arto Salomaa,et al.  Formal Languages: an Introduction and a Synopsis , 1997, Handbook of Formal Languages.

[13]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[14]  Yoav Shoham,et al.  Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .

[15]  Christel Baier,et al.  Principles of model checking , 2008 .

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

[17]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[18]  Alexander Moshe Rabinovich,et al.  Expressive Power of Temporal Logics , 2002, CONCUR.

[19]  William Craig,et al.  Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory , 1957, Journal of Symbolic Logic.

[20]  Cees Witteveen,et al.  Boolean games , 2001 .

[21]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[22]  A. Prasad Sistla,et al.  The complexity of propositional linear temporal logics , 1982, STOC '82.

[23]  Sarit Kraus,et al.  Designing incentives for Boolean games , 2011, AAMAS.

[24]  Pierre Wolper.  Temporal Logic Can Be More Expressive , 1983, Inf. Control..

[25]  Michael Wooldridge,et al.  Reasoning about equilibria in game-like concurrent systems , 2014, Ann. Pure Appl. Log..

[26]  Stephan Merz,et al.  Model Checking , 2000 .

[27]  Michael Wooldridge,et al.  Iterated Boolean games , 2013, Inf. Comput..

[28]  M. Dufwenberg.  Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.

[29]  Balder ten Cate,et al.  Craig Interpolation for Linear Temporal Languages , 2009, CSL.

[30]  Joseph Y. Halpern,et al.  ON DEFINABILITY IN MULTIMODAL LOGIC , 2009, The Review of Symbolic Logic.

[31]  Christel Baier,et al.  Principles of Model Checking (Representation and Mind Series) , 2008 .

[32]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[33]  Evert W. Beth,et al.  On Padoa’s Method in the Theory of Definition , 1953 .

[34]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .