Searching a Variable Speed Network
From MaRDI portal
Publication:5244863
DOI10.1287/moor.2013.0634zbMath1308.90072OpenAlexW2046195308MaRDI QIDQ5244863
Thomas F. Lidbetter, Steven 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
Related Items (13)
Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object ⋮ Search and delivery man problems: when are depth-first paths optimal? ⋮ Optimal patrolling strategies for trees and complete networks ⋮ On Submodular Search and Machine Scheduling ⋮ Search Games for an Immobile Hider ⋮ Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games ⋮ A search problem on a bipartite network ⋮ Weighted network search games with multiple hidden objects and multiple search teams ⋮ 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 ⋮ A game theoretic approach to a problem in polymatroid maximization ⋮ Search games on a network with travelling and search costs
Cites Work
- Search for an immobile entity on a network
- 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
- Find-and-Fetch Search on a Tree
- Search Games on Trees with Asymmetric Travel Times
- The search game on a network with immobile hider
- Rendezvous Search: A Personal Perspective
- A Mixed-Strategy Minimax Theorem without Compactness
- Search Games with Mobile and Immobile Hider
- A SEARCH GAME WITH TRAVELING COST ON A TREE
- Asymmetric Rendezvous on the Line Is a Double Linear Search Problem
- Mining Coal or Finding Terrorists: The Expanding Search Paradigm
- Search games on networks with travelling and search costs and with arbitrary searcher starting points
- Alternating search at two locations
This page was built for publication: Searching a Variable Speed Network
