Mining Coal or Finding Terrorists: The Expanding Search Paradigm

DOI10.1287/opre.1120.1134zbMath1273.90221OpenAlexW1967613325MaRDI QIDQ5301126

Thomas F. Lidbetter, Steven Alpern

Publication date: 2 July 2013

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: http://eprints.lse.ac.uk/50501/1/__lse.ac.uk_storage_LIBRARY_Secondary_libfile_shared_repository_Content_Lidbetter%2C%20T_Mining%20coal%20finding%20terrorists_Lidbetter_Mining%20coal%20finding%20terrorists_2015.pdf

zbMATH Keywords

tree algorithmsgames/group decisions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Games involving graphs (91A43)

Related Items (29)

Technical Note—Trading Off Quick versus Slow Actions in Optimal Search ⋮ Further connections between contract-scheduling and ray-searching problems ⋮ Historical evolution and benefit-cost explanation of periodical fluctuation in coal mine safety supervision: an evolutionary game analysis framework ⋮ Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object ⋮ Network construction/restoration problems: cycles and complexity ⋮ Exact and Approximation Algorithms for the Expanding Search Problem ⋮ A General Framework for Approximating Min Sum Ordering Problems ⋮ The pairwise flowtime network construction problem ⋮ Search and delivery man problems: when are depth-first paths optimal? ⋮ Search and rescue in the face of uncertain threats ⋮ Competitive search in a network ⋮ Optimal patrolling strategies for trees and complete networks ⋮ The search and rescue game on a cycle ⋮ On Submodular Search and Machine Scheduling ⋮ On the approximation ratio of the random Chinese postman tour for network search ⋮ Search Games for an Immobile Hider ⋮ The search value of a set ⋮ Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games ⋮ A search problem on a bipartite network ⋮ The expanding search ratio of a graph ⋮ Tree optimization based heuristics and metaheuristics in network construction problems ⋮ A polynomial-time method to compute all Nash equilibria solutions of a general two-person inspection game ⋮ 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 ⋮ Searching a Variable Speed Network ⋮ 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

This page was built for publication: Mining Coal or Finding Terrorists: The Expanding Search Paradigm