Pages that link to "Item:Q4186121"
From MaRDI portal
The following pages link to Search Games with Mobile and Immobile Hider (Q4186121):
Displayed 43 items.
- Cop vs. gambler (Q267177) (← links)
- Optimal search and ambush for a hider who can escape the search region (Q322755) (← links)
- Screening and hiding versus search (Q486938) (← links)
- A new approach to Gal's theory of search games on weakly Eulerian networks (Q692087) (← links)
- Estimation of distributions involving unobservable events: the case of optimal search with unknown target distributions (Q710617) (← links)
- A property of random walks on a cycle graph (Q740121) (← links)
- Search game in a rectangle (Q915664) (← links)
- Search for an immobile entity on a network (Q933506) (← links)
- Escaping offline searchers and isoperimetric theorems (Q955225) (← links)
- A two-cell model of search for an evading target (Q1155507) (← links)
- A remark on the Princess and Monster search game (Q1185762) (← links)
- On the approximation ratio of the random Chinese postman tour for network search (Q1694817) (← links)
- The search value of a set (Q1699127) (← links)
- A composite game of hide and seek (Q1725817) (← links)
- Continuous patrolling and hiding games (Q1735165) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- Stochastic search in a convex region (Q1822144) (← links)
- Weighted network search games with multiple hidden objects and multiple search teams (Q2028828) (← links)
- Planning a multi-sensors search for a moving target considering traveling costs (Q2030597) (← links)
- Search for a moving target in a competitive environment (Q2041083) (← links)
- Social distancing, gathering, search games: mobile agents on simple networks (Q2128973) (← links)
- A competitive search game with a moving target (Q2158054) (← links)
- Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
- Search and rescue in the face of uncertain threats (Q2184077) (← links)
- Competitive search in a network (Q2184175) (← links)
- Formulation of a cooperative-confinement-escape problem of multiple cooperative defenders against an evader escaping from a circular region (Q2200240) (← links)
- Search for an immobile hider on a stochastic network (Q2286995) (← links)
- Approximate solutions for expanding search games on general networks (Q2327672) (← links)
- Search for an immobile hider in a known subset of a network (Q2328862) (← links)
- Static search games played over graphs and general metric spaces (Q2356189) (← links)
- Finding a moving fugitive. A game theoretic representation of search (Q2462540) (← links)
- Accumulation of switchings in search problems (Q2519225) (← links)
- Patrolling a Border (Q2957456) (← links)
- Search Games: A Review (Q2961390) (← links)
- Search Games for an Immobile Hider (Q2961391) (← links)
- Tools to Manage Search Games on Lattices (Q2961392) (← links)
- Applications of Search in Biology: Some Open Problems (Q2961411) (← links)
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object (Q3195234) (← links)
- Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)
- Searching a Variable Speed Network (Q5244863) (← links)
- Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem (Q5387746) (← links)
- StarCraft adversary-agent challenge for pursuit-evasion game (Q6061061) (← links)
- Optimal patrolling strategies for trees and complete networks (Q6096604) (← links)