Search Games with Mobile and Immobile Hider
From MaRDI portal
Publication:4186121
DOI10.1137/0317009zbMath0401.90110OpenAlexW2013679020WikidataQ57257188 ScholiaQ57257188MaRDI QIDQ4186121
Publication date: 1979
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0317009
Related Items (43)
Cop vs. gambler ⋮ Social distancing, gathering, search games: mobile agents on simple networks ⋮ Optimal search and ambush for a hider who can escape the search region ⋮ A competitive search game with a moving target ⋮ Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object ⋮ 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 ⋮ StarCraft adversary-agent challenge for pursuit-evasion game ⋮ Optimal patrolling strategies for trees and complete networks ⋮ Patrolling a Border ⋮ On the approximation ratio of the random Chinese postman tour for network search ⋮ Search Games: A Review ⋮ Search Games for an Immobile Hider ⋮ Tools to Manage Search Games on Lattices ⋮ Applications of Search in Biology: Some Open Problems ⋮ The search value of a set ⋮ Formulation of a cooperative-confinement-escape problem of multiple cooperative defenders against an evader escaping from a circular region ⋮ A two-cell model of search for an evading target ⋮ Search game in a rectangle ⋮ Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games ⋮ A composite game of hide and seek ⋮ Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem ⋮ Search for an immobile entity on a network ⋮ Screening and hiding versus search ⋮ Continuous patrolling and hiding games ⋮ A remark on the Princess and Monster search game ⋮ Finding a moving fugitive. A game theoretic representation of search ⋮ The expanding search ratio of a graph ⋮ Escaping offline searchers and isoperimetric theorems ⋮ A new approach to Gal's theory of search games on weakly Eulerian networks ⋮ Estimation of distributions involving unobservable events: the case of optimal search with unknown target distributions ⋮ Weighted network search games with multiple hidden objects and multiple search teams ⋮ Planning a multi-sensors search for a moving target considering traveling costs ⋮ Search for an immobile hider on a stochastic network ⋮ Search for a moving target in a competitive environment ⋮ Accumulation of switchings in search problems ⋮ A property of random walks on a cycle graph ⋮ Stochastic search in a convex region ⋮ 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 ⋮ Static search games played over graphs and general metric spaces
This page was built for publication: Search Games with Mobile and Immobile Hider
