Expressiveness and Nash Equilibrium in Iterated Boolean Games

被引:0
作者
Gutierrez, Julian [1 ,4 ,5 ]
Harrenstein, Paul [2 ]
Perelli, Giuseppe [3 ,6 ]
Wooldridge, Michael [2 ]
机构
[1] Monash Univ, Melbourne, Vic, Australia
[2] Univ Oxford, Dept Comp Sci, Wolfson Bldg,Parks Rd, Oxford OX1 3QD, England
[3] Sapienza Univ Rome, Rome, Italy
[4] Dept Data Sci, Melbourne, Vic, Australia
[5] AI 26 Ancora Imparo Way,Clayton Campus, Melbourne, Vic, Australia
[6] Dept Comp Automat & Business Engn, Via Ariosto 25, Rome, Italy
基金
欧洲研究理事会;
关键词
Logic; game theory; Nash equilibrium; concurrent games; multi-agent systems; expressiveness; TEMPORAL PROPERTIES; COMPLEXITY;
D O I
10.1145/3439900
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We define and investigate a novel notion of expressiveness for temporal logics that is based on game theoretic equilibria of multi-agent systems. We use iterated Boolean games as our abstract model of multi-agent systems [Gutierrez et al. 2013, 2015a]. In such a game, each agent i has a goal gamma(i), represented using (a fragment of) Linear Temporal Logic (LTL). The goal gamma(i) captures agent i's preferences, in the sense that the models of gamma(i) represent system behaviours that would satisfy i. Each player controls a subset of Boolean variables phi(i), and at each round in the game, player i is at liberty to choose values for variables phi(i) in any way that she sees fit. Play continues for an infinite sequence of rounds, and so as players act they collectively trace out a model for LTL, which for every player will either satisfy or fail to satisfy their goal. Players are assumed to act strategically, taking into account the goals of other players, in an attempt to bring about computations satisfying their goal. In this setting, we apply the standard game-theoretic concept of (pure) Nash equilibria. The (possibly empty) set of Nash equilibria of an iterated Boolean game can be understood as inducing a set of computations, each computation representing one way the system could evolve if players chose strategies that together constitute a Nash equilibrium. Such a set of equilibrium computations expresses a temporal property-which may or may not be expressible within a particular LTL fragment. The new notion of expressiveness that we formally define and investigate is then as follows: What temporal properties are characterised by the Nash equilibria of games in which agent goals are expressed in specific fragments of LTL? We formally define and investigate this notion of expressiveness for a range of LTL fragments. For example, a very natural question is the following: Suppose we have an iterated Boolean game in which every goal is represented using a particular fragment L of LTL: is it then always the case that the equilibria of the game can be characterised within L? We show that this is not true in general.
引用
收藏
页数:38
相关论文
共 61 条
[1]   Alternating-time temporal logic [J].
Alur, R ;
Henzinger, TA ;
Kupferman, O .
JOURNAL OF THE ACM, 2002, 49 (05) :672-713
[2]   Reactive modules [J].
Alur, R ;
Henzinger, TA .
FORMAL METHODS IN SYSTEM DESIGN, 1999, 15 (01) :7-48
[3]   EPISTEMIC CONDITIONS FOR NASH EQUILIBRIUM [J].
AUMANN, R ;
BRANDENBURGER, A .
ECONOMETRICA, 1995, 63 (05) :1161-1180
[4]  
Baier C, 2008, PRINCIPLES OF MODEL CHECKING, P1
[5]  
Beth E. W., 1953, INDAG MATH, V15, P330, DOI [10.1016/S1385-7258(53)50042-3, DOI 10.1016/S1385-7258(53)50042-3]
[6]  
Bonzon E, 2006, FRONT ARTIF INTEL AP, V141, P265
[7]   Reasoning about temporal properties of rational play [J].
Bulling, Nils ;
Jamroga, Wojciech ;
Dix, Juergen .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2008, 53 (1-4) :51-114
[8]  
Cerná I, 2003, LECT NOTES COMPUT SC, V2747, P318
[9]  
Chang C. C., 1990, MODEL THEORY, V73
[10]  
CHANG E, 1992, LECT NOTES COMPUT SC, V623, P474