Search games on a network with travelling and search costs
From MaRDI portal
Publication:2349413
DOI10.1007/s00182-014-0432-zzbMath1388.91067OpenAlexW2011252431MaRDI QIDQ2349413
Publication date: 22 June 2015
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00182-014-0432-z
Related Items (9)
Search and rescue in the face of uncertain threats ⋮ On the approximation ratio of the random Chinese postman tour for network search ⋮ Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games ⋮ Online failure diagnosis in interdependent networks ⋮ A search problem on a bipartite network ⋮ The expanding search ratio of a graph ⋮ Weighted network search games with multiple hidden objects and multiple search teams ⋮ Approximate solutions for expanding search games on general networks ⋮ Search for an immobile hider in a known subset of a network
Cites Work
- Network search games with immobile hider, without a designated searcher starting point
- The theory of search games and rendezvous.
- Search Games: A Review
- Searching symmetric networks with Utilitarian-Postman paths
- Min-Max K -vehicles windy rural postman problem
- Search Games on Trees with Asymmetric Travel Times
- Network search games, with arbitrary searcher starting point
- The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
- Initial point search on weighted trees
- A search game on a cyclic graph
- A SEARCH GAME WITH TRAVELING COST ON A TREE
- Searching a Variable Speed Network
- Mining Coal or Finding Terrorists: The Expanding Search Paradigm
- Search games on networks with travelling and search costs and with arbitrary searcher starting points
This page was built for publication: Search games on a network with travelling and search costs
