Deviator Detection under Imperfect Monitoring

Grim-trigger strategies are a fundamental mechanism for sustaining equilibria in iterated games: the players cooperate along an agreed path, and as soon as one player deviates, the others form a coalition to play him down to his minmax level. A precondition to triggering such a strategy is that the identity of the deviating player becomes common knowledge among the other players. This can be difficult or impossible to attain in games where the information structure allows only imperfect monitoring of the played actions or of the global state. We study the problem of synthesising finite-state strategies for detecting the deviator from an agreed strategy profile in games played on finite graphs with different information structures. We show that the problem is undecidable in the general case where the global state cannot be monitored. On the other hand, we prove that under perfect monitoring of the global state and imperfect monitoring of actions, the problem becomes decidable, and we present an effective synthesis procedure that covers infinitely repeated games with private monitoring.

[1]  Fabian Kuhn,et al.  Deploying Wireless Networks with Beeps , 2010, DISC.

[2]  M. Amarante Recursive structure and equilibria in games with private monitoring , 2003 .

[3]  Bernd Finkbeiner,et al.  Uniform distributed synthesis , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[4]  G. Mailath,et al.  Repeated Games and Reputations: Long-Run Relationships , 2006 .

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

[6]  O. Kupermann,et al.  Synthesizing distributed systems , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[7]  Michihiro Kandori,et al.  Private Observation, Communication and Collusion , 1998 .

[8]  Michael Wooldridge,et al.  Equilibria of concurrent games on event structures , 2014, CSL-LICS.

[9]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[10]  Krishnendu Chatterjee,et al.  Doomsday equilibria for omega-regular games , 2017, Inf. Comput..

[11]  Joseph Y. Halpern Computer Science and Game Theory: A Brief Survey , 2007, ArXiv.

[12]  John H. Reif,et al.  Multiple-person alternation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[13]  Yoram Moses,et al.  Relating Knowledge and Coordinated Action: The Knowledge of Preconditions Principle , 2016, TARK.

[14]  Jean-François Raskin,et al.  Multiple-Environment Markov Decision Processes , 2014, FSTTCS.

[15]  Amir Pnueli,et al.  Distributed reactive systems are hard to synthesize , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[16]  Patricia Bouyer,et al.  Concurrent Games with Ordered Objectives , 2012, FoSSaCS.

[17]  Orna Kupferman,et al.  Synthesizing Distributed Systems , 2001, LICS.

[18]  Lukasz Kaiser,et al.  A Perfect-Information Construction for Coordination in Games , 2011, FSTTCS.