The theory of search games and rendezvous. (Q1416614): Difference between revisions

The referred book deals with a specific autonomous problem of search and rendezvous of two players called searcher and hider. Two basic types of such games differing in the motivation of the hider are studied in two main parts of the book. In both of them the searcher aims to minimize the time of searching. In the search problem, the game is antagonistc and the hider wishes to maximize that time, meanwhile in the rendezvous search both players wish to meet as soon as possible. In both of these main parts the games in compact spaces and the games on unbounded domains are considered separately. For the search game the cases of immobile and mobile hider are distinguished. The rendezvous search is, in separate sections, focused on some specific cases like rendezvous on labeled network, unlabeled circle, search on graph, on line and in higher dimensions.