scientific article; zbMATH DE number 3823533

zbMATH Open0519.90096MaRDI QIDQ3670933FDOQ3670933

Authors: William H. Ruckle 

Publication date: 1983

Title of this publication is not available (Why is that?)

zbMATH Keywords

partial informationEulerian graphcyclic graphpursuitevasiongames of search and ambushgeometric games

Mathematics Subject Classification ID

Search theory (90B40) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) 2-person games (91A05) Games involving graphs (91A43) Applications of graph theory to circuits and networks (94C15) Positional games (pursuit and evasion, etc.) (91A24)

Cited In (47)

• The Number Hides Game
• Raid games across a set with cyclic order
• Initial point search on weighted trees
• A generalized inspection game
• The cardinality of the sets involved in lattice games
• The value of the two cable ambush game
• A continuous game of ambush
• Optimizing periodic patrols against short attacks on the line and other networks
• Title not available (Why is that?)
• Social distancing, gathering, search games: mobile agents on simple networks
• Searching symmetric networks with Utilitarian-Postman paths
• Inspection games in arms control
• Tools to manage search games on lattices
• A search game on a cyclic graph
• Continuous accumulation games in continuous regions
• Some Cinderella Ruckle type games
• The solution to an open problem for a caching game
• The reporting time problem: Integration of intelligence with verification
• A foraging problem: sit-and-wait versus active predation
• A Caching Game with Infinitely Divisible Hidden Material
• Title not available (Why is that?)
• Rendezvous search on the line with bounded resources: Expected time minimization
• Network search games with immobile hider, without a designated searcher starting point
• A game locating a needle in a square haystack
• Accumulation games. I: Noisy search
• Infiltration games on arbitrary graphs
• Discretization of the continuous ambush game
• Ambush and active search in multistage predator-prey interactions
• Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory
• Technical note -- Optimal patrol of a perimeter
• A one-dimensional helicopter-submarine game
• Cumulative search-evasion games
• Title not available (Why is that?)
• Efficient distributions of arms‐control inspection effort
• A game related to the number of hides game
• A remark on a helicopter and submarine game
• Some games of search on a lattice
• A remark on the Princess and Monster search game
• Rendezvous of three agents on the line
• On simple MIX game
• Patrolling a perimeter
• A generalization of Ruckle's results for an ambush game
• An infiltration game on k arcs
• Continuous patrolling and hiding games
• A search game with unknown examination costs and travel times
• Static search games played over graphs and general metric spaces
• Weighted search games

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3670933)