A SEARCH GAME WITH TRAVELING COST ON A TREE

DOI10.15807/JORSJ.38.70zbMath0839.90064OpenAlexW380973736MaRDI QIDQ4860667

Kensaku Kikuta

Publication date: 16 January 1996

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.38.70

zbMATH Keywords

searcherrooted treehidertraveling cost

Mathematics Subject Classification ID

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

Related Items (7)

Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object ⋮ Search games on networks with travelling and search costs and with arbitrary searcher starting points ⋮ Network search games with immobile hider, without a designated searcher starting point ⋮ A new approach to Gal's theory of search games on weakly Eulerian networks ⋮ Searching symmetric networks with Utilitarian-Postman paths ⋮ Searching a Variable Speed Network ⋮ Search games on a network with travelling and search costs

This page was built for publication: A SEARCH GAME WITH TRAVELING COST ON A TREE