A new approach to Gal's theory of search games on weakly Eulerian networks
From MaRDI portal
Publication:692087
DOI10.1007/s13235-011-0009-4zbMath1252.91023MaRDI QIDQ692087
Publication date: 4 December 2012
Published in: Dynamic Games and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13235-011-0009-4
Related Items
On the approximation ratio of the random Chinese postman tour for network search, Social distancing, gathering, search games: mobile agents on simple networks, Search and delivery man problems: when are depth-first paths optimal?, Approximate solutions for expanding search games on general networks, Search for an immobile hider in a known subset of a network, Codes, lower bounds, and phase transitions in the symmetric rendezvous problem, Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object
Cites Work
- Search games
- 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
- Find-and-Fetch Search on a Tree
- Search Games on Trees with Asymmetric Travel Times
- Network search games, with arbitrary searcher starting point
- A Mixed-Strategy Minimax Theorem without Compactness
- Search Games with Mobile and Immobile Hider
- Initial point search on weighted trees
- A search game on the union of graphs with immobile hider
- A SEARCH GAME WITH TRAVELING COST ON A TREE
- On Some Differential Games
- Alternating search at two locations