Searching a variable speed network

DOI10.1287/MOOR.2013.0634MaRDI QIDQ5244863zbMATH OpenOpenAlexFDO

Authors Thomas Lidbetter, Steve Alpern

Publication date 31 March 2015

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL http://eprints.lse.ac.uk/59638/1/__lse.ac.uk_storage_LIBRARY_Secondary_libfile_shared_repository_Content_Lidbetter%2C%20T_Searching%20variable_Lidbetter_Searching%20variable_2015.pdf

zbMATH Keywords

gameimmobile hiderminimaxnetworksearchsearch game

Mathematics Subject Classification ID

Pursuit and evasion games (49N75) Search theory (90B40) Games involving graphs (91A43)

Recommendations

• The search value of a network
• Search for an immobile hider in a known subset of a network
• Search games on trees with asymmetric travel times
• The search game on a network with immobile hider
• Approximate solutions for expanding search games on general networks

Cites work

• A Mixed-Strategy Minimax Theorem without Compactness
• A SEARCH GAME WITH TRAVELING COST ON A TREE
• Alternating search at two locations
• Asymmetric Rendezvous on the Line Is a Double Linear Search Problem
• Complexity of searching an immobile hider in a graph
• Find-and-fetch search on a tree
• Mining coal or finding terrorists: the expanding search paradigm
• On the optimality of a simple strategy for searching graphs
• Rendezvous Search: A Personal Perspective
• Search for an immobile entity on a network
• Search games and other applications of game theory
• Search games on networks with travelling and search costs and with arbitrary searcher starting points
• Search games on trees with asymmetric travel times
• Search games with immobile hider
• Search Games with Mobile and Immobile Hider
• The search game on a network with immobile hider
• The theory of search games and rendezvous.

Cited in

(20)

• A search problem on a bipartite network
• Weighted network search games with multiple hidden objects and multiple search teams
• A game theoretic approach to a problem in polymatroid maximization
• Search and delivery man problems: when are depth-first paths optimal?
• Competitive search in a network
• Search for an immobile hider on a stochastic network
• Approximate solutions for expanding search games on general networks
• Search for an immobile hider in a known subset of a network
• Search games on a network with travelling and search costs
• Search games for an immobile hider
• 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
• The search value of a network
• On Submodular Search and Machine Scheduling
• Solving zero-sum games using best-response oracles with applications to search games
• Mining coal or finding terrorists: the expanding search paradigm
• Optimal patrolling strategies for trees and complete networks
• Traveling between dispersed locations to search for a hidden object
• Search for an immobile entity on a network

This page was built for publication: Searching a variable speed network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244863)