Nash Equilibria in Concurrent Games with Lexicographic Preferences

We study concurrent games with finite-memory strategies where players are given a Büchi and a mean-payoff objective, which are related by a lexicographic order: a player first prefers to satisfy its Büchi objective, and then prefers to minimise costs, which are given by a mean-payoff function. In particular, we show that deciding the existence of a strict Nash equilibrium in such games is decidable, even if players’ deviations are implemented as infinite memory strategies.

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

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

[3]  C. Papadimitriou,et al.  The complexity of nash equilibria , 2008 .

[4]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[5]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[6]  Krishnendu Chatterjee,et al.  Energy parity games☆ , 2012, Theoretical Computer Science.

[7]  Nguyen Hoang Nga,et al.  Model-checking for Resource-Bounded ATL with production and consumption of resources , 2015, J. Comput. Syst. Sci..

[8]  Krishnendu Chatterjee,et al.  Better Quality in Synthesis through Quantitative Objectives , 2009, CAV.

[9]  Bernd Gärtner,et al.  Understanding and using linear programming , 2007, Universitext.

[10]  Dominik Wojtczak,et al.  The Complexity of Nash Equilibria in Limit-Average Games , 2011, CONCUR.

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

[12]  R. Lathe.  Phd by thesis , 1988, Nature.

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

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

[15]  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.

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

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

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

[19]  Krishnendu Chatterjee,et al.  Mean-payoff parity games , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[20]  Gregory F. Sullivan,et al.  Detecting cycles in dynamic graphs in polynomial time , 1988, STOC '88.

[21]  Patricia Bouyer,et al.  Pure Nash Equilibria in Concurrent Deterministic Games , 2015, Log. Methods Comput. Sci..

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