A SEARCH GAME WITH TRAVELING COST ON A TREE
From MaRDI portal
Publication:4860667
DOI10.15807/jorsj.38.70zbMath0839.90064MaRDI QIDQ4860667
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
Related Items
Searching a Variable Speed Network, Search games on networks with travelling and search costs and with arbitrary searcher starting points, A new approach to Gal's theory of search games on weakly Eulerian networks, Network search games with immobile hider, without a designated searcher starting point, Search games on a network with travelling and search costs, Searching symmetric networks with Utilitarian-Postman paths, Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object