Search games with multiple hidden objects

DOI10.1137/120893938MaRDI QIDQ2862458zbMATH OpenOpenAlexFDO

Authors Thomas Lidbetter

Publication date 15 November 2013

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL http://eprints.lse.ac.uk/55103/

zbMATH Keywords

discrete optimizationnetworksearch game

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Search theory (90B40) 2-person games (91A05) Dynamic games (91A25)

Recommendations

• Searching for multiple objects in multiple locations
• Weighted network search games with multiple hidden objects and multiple search teams
• scientific article; zbMATH DE number 1023202
• Search games on a network with travelling and search costs
• Search games on networks with travelling and search costs and with arbitrary searcher starting points

Cited in

(25)

• The search value of a set
• Continuous patrolling and hiding games
• The expanding search ratio of a graph
• Searching for multiple objects in multiple locations
• Weighted network search games with multiple hidden objects and multiple search teams
• A game theoretic approach to a problem in polymatroid maximization
• A search game on a hypergraph with booby traps
• Search and delivery man problems: when are depth-first paths optimal?
• Search and rescue in the face of uncertain threats
• Approximate solutions for expanding search games on general networks
• Search for an immobile hider in a known subset of a network
• Exact and heuristic approaches to detect failures in failed \(k\)-out-of-\(n\) systems
• Game-based modeling of independent searchers who share a common goal
• The solution to an open problem for a caching game
• Optimal trade-off between speed and acuity when searching for a small object
• On Submodular Search and Machine Scheduling
• Solving zero-sum games using best-response oracles with applications to search games
• Control sequencing in a game of identity pursuit-evasion
• The search and rescue game on a cycle
• Optimal linear tracking for a hidden target on one of \(K\)-intervals
• A study on the existence of a cooperative search method with reducing the first metting time between one of several nano-sensors and a Brownian particle
• Optimal pure strategies for a discrete search game
• Discrete search stability for a hidden target on M-intervals with a known probabilistic distributed effort
• Blotto game with testing (the locks, bombs and testing model)
• Traveling between dispersed locations to search for a hidden object

This page was built for publication: Search games with multiple hidden objects

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