A SEARCH GAME WITH TRAVELING COST ON A TREE
From MaRDI portal
Publication:4860667
Recommendations
- A SEARCH GAME WITH TRAVELING COST
- Search games on trees with asymmetric travel times
- The minimum cost shortest-path tree game
- Search games on a broken wheel with traveling and search costs
- Optimal Search on Some Game Trees
- A search game with unknown examination costs and travel times
- The tree search game for two players
- A search game with a non-additive cost
- A search game when a search path is given
Cited in
(16)- Search-hide games on trees
- Search games on a network with travelling and search costs
- A search game with a non-additive cost
- A search game with unknown examination costs and travel times
- Searching symmetric networks with Utilitarian-Postman paths
- Search games on trees with asymmetric travel times
- Optimal trade-off between speed and acuity when searching for a small object
- A HIDE AND SEEK GAME WITH TRAVELING COST
- A SEARCH GAME WITH TRAVELING COST
- Initial point search on weighted trees
- scientific article; zbMATH DE number 1908247 (Why is no real title available?)
- The tree search game for two players
- 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
This page was built for publication: A SEARCH GAME WITH TRAVELING COST ON A TREE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4860667)
