Synthesis of Controllable Nash Equilibria in Quantitative Objective Game

In Rational Synthesis, we consider a multi-agent system in which some of the agents are controllable and some are not. All agents have objectives, and the goal is to synthesize strategies for the controllable agents so that their objectives are satisfied, assuming rationality of the uncontrollable agents. Previous work on rational synthesis considers objectives in LTL, namely ones that describe on-going behaviors, and in Objective-LTL, which allows ranking of LTL formulas. In this paper, we extend rational synthesis to LTL[F ]– an extension of LTL by quality operators. The satisfaction value of an LTL[F ] formula is a real value in [0, 1], where the higher the value is, the higher is the quality in which the computation satisfies the specification. The extension significantly strengthens the framework of rational synthesis and enables a study its gameand social-choice theoretic aspects. In particular, we study the price of stability and price of anarchy of the rational-synthesis game and use them to explain the cooperative and non-cooperative settings of rational synthesis. Our algorithms make use of strategy logic and decision procedures for it. Thus, we are able to handle the richer quantitative setting using existing tools. In particular, we show that the cooperative and non-cooperative versions of quantitative rational synthesis are 2EXPTIME-complete and in 3EXPTIME, respectively – not harder than the complexity known for their Boolean analogues.

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

[2]  Axel Legay,et al.  Model Checking Quantitative Linear Time Logic , 2008, QAPL.

[3]  Jean-François Raskin,et al.  The Complexity of Rational Synthesis , 2016, ICALP.

[4]  Tim Roughgarden,et al.  The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[5]  Fabio Mogavero.  Reasoning About Strategies , 2013, FSTTCS 2013.

[6]  Orna Kupferman,et al.  Repairing Multi-Player Games , 2015, CONCUR.

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

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

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

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

[11]  Michael Wooldridge,et al.  Iterated Games with LDL Goals over Finite Traces , 2017, AAMAS.

[12]  Christos H. Papadimitriou,et al.  Algorithms, Games, and the Internet , 2001, ICALP.

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

[14]  Aniello Murano,et al.  Reasoning about Strategies: on the Satisfiability Problem , 2016, Log. Methods Comput. Sci..

[15]  Michael Wooldridge,et al.  Rational Verification: From Model Checking to Equilibrium Checking , 2016, AAAI.

[16]  P. Gács,et al.  Algorithms , 1992 .

[17]  Johan van Benthem,et al.  Reasoning about Strategies , 2013, Computation, Logic, Games, and Quantum Foundations.

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

[19]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[20]  Orna Kupferman,et al.  Formalizing and Reasoning about Quality , 2013, ICALP.

[21]  M. Wooldridge,et al.  Imperfect Information in Reactive Modules Games , 2016, KR.

[22]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

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

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

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

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