
Accession Number : AD0639921
Title : SEARCH AND EVASION GAMES.
Descriptive Note : Technical rept./research paper,
Corporate Author : NAVAL POSTGRADUATE SCHOOL MONTEREY CALIF
Personal Author(s) : Schroeder,Roger G.
Report Date : JUN 1966
Pagination or Media Count : 39
Abstract : The author develops some twoperson zerosum formulations of search and evasion problems. By employing a game theoretic approach, he allows the hider, as well as the searcher, to choose a strategy. This is in contrast to most search models which assume a stationary or passive hider. Both nonsequential and sequential search games are investigated. Some interesting aspects of the nonsequential game and an example of an antisubmarine search problem are given. The sequential games consist of a sequence of moves. When the players move, they not only determine a payoff but also the probability that the game terminates before the next move. When at most a finite number of moves is allowed, he proves that a solution may be found by solving a recursive sequence of matrix games. When the number of moves is not bounded, the game is characterized by a special type of nonlinear program. The solution to this program can be approximated by successive perturbations of a related linear program. He obtains the result that a pair of strategies minimaxes the expected duration of the game if and only if these strategies also maximin the probability of termination in one step. (Author)
Descriptors : (*WAR GAMES, EVASION), (*SEARCH THEORY, *GAME THEORY), SEQUENTIAL ANALYSIS, MATHEMATICAL MODELS, STOCHASTIC PROCESSES, ANTISUBMARINE WARFARE
Subject Categories : Operations Research
Undersea and Antisubmarine Warfare
Distribution Statement : APPROVED FOR PUBLIC RELEASE