Multi-Step Multi-Sensor Hider-Seeker Games

We study a multi-step hider-seeker game where the hider is moving on a graph and, in each step, the seeker is able to search c subsets of the graph nodes. We model this game as a zero-sum Bayesian game, which can be solved in weakly polynomial time in the players' action spaces. The seeker's action space is exponential in c, and both players' action spaces are exponential in the game horizon. To manage this intractability, we use a column/constraint generation approach for both players. This approach requires an oracle to determine best responses for each player. However, we show that computing a best response for the seeker is NP-hard, even for a single-step game when c is part of the input, and that computing a best response is NP-hard for both players for the multi-step game, even if c = 1. An integer programming formulation of the best response for the hider is practical for moderate horizons, but computing an exact seeker best response is impractical due to the exponential dependence on both c and the horizon. We therefore develop an approximate best response oracle with bounded suboptimality for the seeker. We prove performance bounds on the strategy that results when column/constraint generation with approximate best responses converges, and we measure the performance of our algorithm in simulations. In our experimental results, column/constraint generation converges to near-minimax strategies for both players fairly quickly.

[1]  T. D. Parsons,et al.  Pursuit-evasion in a graph , 1978 .

[2]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[3]  Christos H. Papadimitriou,et al.  The complexity of searching a graph , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[4]  D. Koller,et al.  The complexity of two-person zero-sum games in extensive form , 1992 .

[5]  Mark S. Boddy,et al.  Deliberation Scheduling for Problem Solving in Time-Constrained Environments , 1994, Artif. Intell..

[6]  Rajeev Kohli,et al.  The Minimum Satisfiability Problem , 1994, SIAM J. Discret. Math..

[7]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

[8]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[9]  B. Stengel,et al.  Efficient Computation of Behavior Strategies , 1996 .

[10]  Shlomo Zilberstein,et al.  Using Anytime Algorithms in Intelligent Systems , 1996, AI Mag..

[11]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[12]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[13]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[14]  S. Prestwich.  A Hybrid Search Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences , 2000, CP.

[15]  Christos Voudouris.  Solving the Radio Link Frequency Assignment Problem using Guided Local Search , 2001 .

[16]  Micah Adler,et al.  Randomized Pursuit-Evasion In Graphs , 2003, Comb. Probab. Comput..

[17]  Andrea Lodi,et al.  Local Search and Constraint Programming , 2003, Handbook of Metaheuristics.

[18]  Avrim Blum,et al.  Planning in the Presence of Cost Functions Controlled by an Adversary , 2003, ICML.

[19]  Simon de Givry,et al.  Radio Link Frequency Assignment , 1999, Constraints.

[20]  Sampath Kannan,et al.  Randomized pursuit-evasion with limited visibility , 2004, SODA '04.

[21]  Thomas Schiex,et al.  Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison , 1999, Constraints.

[22]  Patrice Boizumault,et al.  On-line resources allocation for ATM networks with rerouting , 2006, Comput. Oper. Res..

[23]  Oriol Carbonell-Nicolau.  Games and Economic Behavior , 2011 .