Bayesian Repeated Zero-Sum Games with Persistent State, with Application to Security Games

We study infinitely-repeated two-player zero-sum games with one-sided private information and a persistent state. Here, only one of the two players learns the state of the repeated game. We consider two models: either the state is chosen by nature, or by one of the players. For the former, the equilibrium of the repeated game is known to be equivalent to that of a one-shot public signaling game, and we make this equivalence algorithmic. For the latter, we show equivalence to one-shot team max-min games, and also provide an algorithmic reduction. We apply this framework to repeated zero-sum security games with private information on the side of the defender and provide an almost complete characterization of their computational complexity.

[1]  B. Stengel,et al.  Team-Maxmin Equilibria☆ , 1997 .

[2]  Aviad Rubinstein,et al.  ETH-Hardness for Signaling in Symmetric Zero-Sum Games , 2015, ArXiv.

[3]  Adam Tauman Kalai,et al.  Dueling algorithms , 2011, STOC '11.

[4]  Milind Tambe,et al.  Security and Game Theory - Algorithms, Deployed Systems, Lessons Learned , 2011 .

[5]  Milind Tambe,et al.  When Security Games Go Green: Designing Defender Strategies to Prevent Poaching and Illegal Fishing , 2015, IJCAI.

[6]  D. Blackwell.  An analog of the minimax theorem for vector payoffs. , 1956 .

[7]  Jérôme Renault,et al.  Repeated Games with Incomplete Information , 2009, Encyclopedia of Complexity and Systems Science.

[8]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[9]  Fei Fang,et al.  Green security games: apply game theory to addressing green security challenges , 2016, SECO.

[10]  Peter L. Bartlett,et al.  Blackwell Approachability and No-Regret Learning are Equivalent , 2010, COLT.

[11]  Shaddin Dughmi,et al.  Algorithmic information structure design: a survey , 2017, SECO.

[12]  Adam Tauman Kalai,et al.  The myth of the folk theorem , 2008, Games Econ. Behav..

[13]  Yu Cheng,et al.  Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games , 2015, EC.

[14]  Emir Kamenica,et al.  Bayesian Persuasion , 2009 .

[15]  Haifeng Xu,et al.  Strategic Coordination of Human Patrollers and Mobile Sensors With Signaling for Security Games , 2018, AAAI.

[16]  Li Han,et al.  Mixture Selection, Mechanism Design, and Signaling , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[17]  Haifeng Xu,et al.  Optimal Patrol Planning for Green Security Games with Black-Box Attackers , 2017, GameSec.

[18]  Santosh S. Vempala,et al.  Efficient Convex Optimization with Membership Oracles , 2017, COLT.

[19]  Lantao Yu,et al.  Deep Reinforcement Learning for Green Security Games with Real-Time Information , 2018, AAAI.

[20]  J. Neumann.  Zur Theorie der Gesellschaftsspiele , 1928 .

[21]  S. Sorin.  A First Course on Zero Sum Repeated Games , 2002 .

[22]  Shaddin Dughmi,et al.  On the hardness of designing public signals , 2019, Games Econ. Behav..