A new approach to Gal's theory of search games on weakly Eulerian networks

DOI10.1007/s13235-011-0009-4zbMath1252.91023OpenAlexW2085534689MaRDI QIDQ692087

Steven Alpern

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

zbMATH Keywords

treezero-sum gamesearch theorysearch game

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (7)

Social distancing, gathering, search games: mobile agents on simple networks ⋮ Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object ⋮ Search and delivery man problems: when are depth-first paths optimal? ⋮ Codes, lower bounds, and phase transitions in the symmetric rendezvous problem ⋮ On the approximation ratio of the random Chinese postman tour for network search ⋮ Approximate solutions for expanding search games on general networks ⋮ Search for an immobile hider in a known subset of a network

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

This page was built for publication: A new approach to Gal's theory of search games on weakly Eulerian networks