Network search games with immobile hider, without a designated searcher starting point
From MaRDI portal
Publication:933761
DOI10.1007/s00182-008-0116-7zbMath1151.91028MaRDI QIDQ933761
Shmuel Gal, Vic Baston, Steven Alpern
Publication date: 25 July 2008
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00182-008-0116-7
91A43: Games involving graphs
Related Items
Search for an immobile entity on a network, Searching symmetric networks with Utilitarian-Postman paths, Hide-and-seek games on a tree to which Eulerian networks are attached
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the minimum diameter spanning tree problem
- Search games
- Complexity of searching an immobile hider in a graph
- On the optimality of a simple strategy for searching graphs
- The theory of search games and rendezvous.
- Search games and other applications of game theory
- Search games with immobile hider
- Online searching with turn cost
- Yet more on the linear search problem
- Network search games, with arbitrary searcher starting point
- Hide-and-seek games on a tree to which Eulerian networks are attached
- The search game on a network with immobile hider
- New Results on the Complexity of p-Centre Problems
- The search value of a network
- The absolute center of a network
- Matching, Euler tours and the Chinese postman
- Arc Routing Problems, Part I: The Chinese Postman Problem
- A SEARCH GAME WITH TRAVELING COST ON A TREE
- On Some Differential Games
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Alternating search at two locations
