Initial point search on weighted trees

DOI10.1002/1520-6750(199410)41:6%3C821::AID-NAV3220410610%3E3.0.CO;2-YMaRDI QIDQ4314865zbMATHOpenAlexFDO

Authors Kensaku Kikuta, William H. Ruckle

Publication date 1 December 1994

Full work available at URL https://doi.org/10.1002/1520-6750(199410)41:6%3C821::aid-nav3220410610%3E3.0.co;2-y

zbMATH Keywords

weighted graphinitial point search game

Mathematics Subject Classification ID

Search theory (90B40) 2-person games (91A05) Games involving graphs (91A43)

Recommendations

• A SEARCH GAME WITH TRAVELING COST ON A TREE
• Connected searching of weighted trees
• Weighted search games
• Search games on networks with travelling and search costs and with arbitrary searcher starting points
• Ambush Strategies in Search Games on Graphs

Cited in

(10)

• Static search games played over graphs and general metric spaces
• Search games on networks with travelling and search costs and with arbitrary searcher starting points
• A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources
• Weighted search games
• A new approach to Gal's theory of search games on weakly Eulerian networks
• Accumulation games. I: Noisy search
• Search games on trees with asymmetric travel times
• Search games on a network with travelling and search costs
• Screening and hiding versus search
• Optimal trade-off between speed and acuity when searching for a small object

This page was built for publication: Initial point search on weighted trees

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