The following pages link to Search games (Q1142712):
Displaying 50 items.
- Infrastructure security games (Q297288) (← links)
- Optimal search and ambush for a hider who can escape the search region (Q322755) (← links)
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- Searching for an axis-parallel shoreline (Q443717) (← links)
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- A new approach to Gal's theory of search games on weakly Eulerian networks (Q692087) (← links)
- Some results of Maria Serna on strategic games: complexity of equilibria and models (Q826318) (← links)
- Search for an immobile entity on a network (Q933506) (← links)
- Network search games with immobile hider, without a designated searcher starting point (Q933761) (← links)
- On the two-dimensional cow search problem (Q987818) (← links)
- Ein operationelles Suchspiel (Q1057174) (← links)
- A remark on the Princess and Monster search game (Q1185762) (← links)
- Infiltration games on arbitrary graphs (Q1191856) (← links)
- On simple MIX game (Q1202564) (← links)
- Star search -- a different show (Q1261911) (← links)
- Coordinated search for an object hidden on the line (Q1278437) (← links)
- Rendezvous search on the line with bounded resources: Expected time minimization (Q1278996) (← links)
- The 3-D detection problem of an evader moving in a fixed plane (Q1311995) (← links)
- On the infiltration game (Q1358634) (← links)
- Complexity of searching an immobile hider in a graph (Q1377669) (← links)
- Flood search under the California split rule. (Q1426720) (← links)
- Searching and on-line recognition of star-shaped polygons. (Q1427863) (← links)
- The capture time of a planar graph (Q1631664) (← links)
- A general framework for searching on a line (Q1676358) (← links)
- Continuous patrolling and hiding games (Q1735165) (← links)
- A search problem on a bipartite network (Q1735184) (← links)
- Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder (Q1761280) (← links)
- Stochastic search in a convex region (Q1822144) (← links)
- Raid games across a set with cyclic order (Q1869504) (← links)
- On-line parallel heuristics, processor scheduling and robot searching under the competitive framework (Q1884992) (← links)
- Online graph exploration: New results on old and new algorithms (Q1929219) (← links)
- Weighted network search games with multiple hidden objects and multiple search teams (Q2028828) (← links)
- Social distancing, gathering, search games: mobile agents on simple networks (Q2128973) (← links)
- Online exploration outside a convex obstacle (Q2166745) (← links)
- Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
- Interruptible algorithms for multiproblem solving (Q2197326) (← 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)
- Search for an immobile hider in a known subset of a network (Q2328862) (← links)
- Optimal discrete search with technological choice (Q2354015) (← links)
- Search games with immobile hider (Q2366102) (← links)
- Optimal scheduling of contract algorithms with soft deadlines (Q2400436) (← links)
- Game theory to a friend's rescue (Q2450668) (← links)
- Online searching with turn cost (Q2503358) (← links)
- Online search for a hyperplane in high-dimensional Euclidean space (Q2671802) (← links)
- A General Framework for Searching on a Line (Q2803819) (← links)
- On the Capture Time of Cops and Robbers Game on a Planar Graph (Q2958299) (← links)
- Search Games: A Review (Q2961390) (← links)
- Search Games for an Immobile Hider (Q2961391) (← links)
- Tools to Manage Search Games on Lattices (Q2961392) (← links)
