Publication:3670933
From MaRDI portal
zbMath0519.90096MaRDI QIDQ3670933
Publication date: 1983
Eulerian graph; partial information; cyclic graph; pursuit; evasion; games of search and ambush; geometric games
90B40: Search theory
91A05: 2-person games
91A43: Games involving graphs
91-02: Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance
94C15: Applications of graph theory to circuits and networks
91A24: Positional games (pursuit and evasion, etc.)
Related Items
Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory, Discretization of the continuous ambush game, Rendezvous of three agents on the line, Efficient distributions of arms‐control inspection effort, A search game on a cyclic graph, Unnamed Item, Unnamed Item, Continuous accumulation games in continuous regions, Ambush and active search in multistage predator-prey interactions, A foraging problem: sit-and-wait versus active predation, Network search games with immobile hider, without a designated searcher starting point, A game locating a needle in a square haystack, A remark on the Princess and Monster search game, Infiltration games on arbitrary graphs, On simple MIX game, Inspection games in arms control, Rendezvous search on the line with bounded resources: Expected time minimization, Accumulation games. I: Noisy search, A generalization of Ruckle's results for an ambush game, Raid games across a set with cyclic order, Patrolling a perimeter, A game related to the number of hides game, Static search games played over graphs and general metric spaces, Weighted search games, The solution to an open problem for a caching game, A SEARCH GAME WITH UNKNOWN EXAMINATION COSTS AND TRAVEL TIMES, A Caching Game with Infinitely Divisible Hidden Material, Searching symmetric networks with Utilitarian-Postman paths, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, The Number Hides Game, Unnamed Item, Unnamed Item
