scientific article
From MaRDI portal
Publication:3670933
zbMath0519.90096MaRDI QIDQ3670933
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eulerian graphpartial informationcyclic graphpursuitevasiongames of search and ambushgeometric games
Search theory (90B40) 2-person games (91A05) Games involving graphs (91A43) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Applications of graph theory to circuits and networks (94C15) Positional games (pursuit and evasion, etc.) (91A24)
Related Items
Social distancing, gathering, search games: mobile agents on simple networks ⋮ Rendezvous of three agents on the line ⋮ Optimizing periodic patrols against short attacks on the line and other networks ⋮ Weighted search games ⋮ Technical Note—Optimal Patrol of a Perimeter ⋮ A generalized inspection game ⋮ A continuous game of ambush ⋮ Accumulation games. I: Noisy search ⋮ Patrolling a perimeter ⋮ A one-dimensional helicopter-submarine game ⋮ A Caching Game with Infinitely Divisible Hidden Material ⋮ A foraging problem: sit-and-wait versus active predation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Tools to Manage Search Games on Lattices ⋮ Some Cinderella Ruckle Type Games ⋮ The Cardinality of the Sets Involved in Lattice Games ⋮ The Value of the Two Cable Ambush Game ⋮ A game related to the number of hides game ⋮ Network search games with immobile hider, without a designated searcher starting point ⋮ Continuous patrolling and hiding games ⋮ Ambush and active search in multistage predator-prey interactions ⋮ A remark on the Princess and Monster search game ⋮ A remark on a helicopter and submarine game ⋮ Infiltration games on arbitrary graphs ⋮ Efficient distributions of arms‐control inspection effort ⋮ A search game on a cyclic graph ⋮ Continuous accumulation games in continuous regions ⋮ On simple MIX game ⋮ Some games of search on a lattice ⋮ Searching symmetric networks with Utilitarian-Postman paths ⋮ Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory ⋮ The solution to an open problem for a caching game ⋮ A generalization of Ruckle's results for an ambush game ⋮ Cumulative search-evasion games ⋮ Inspection games in arms control ⋮ Discretization of the continuous ambush game ⋮ Rendezvous search on the line with bounded resources: Expected time minimization ⋮ Initial point search on weighted trees ⋮ The reporting time problem: Integration of intelligence with verification ⋮ The Number Hides Game ⋮ A game locating a needle in a square haystack ⋮ A SEARCH GAME WITH UNKNOWN EXAMINATION COSTS AND TRAVEL TIMES ⋮ Raid games across a set with cyclic order ⋮ Static search games played over graphs and general metric spaces
This page was built for publication:
