Pages that link to "Item:Q1416614"
From MaRDI portal
The following pages link to The theory of search games and rendezvous. (Q1416614):
Displaying 50 items.
- Convergecast and broadcast by power-aware mobile agents (Q261352) (← links)
- Anonymous meeting in networks (Q262278) (← links)
- Infrastructure security games (Q297288) (← links)
- Optimal search and ambush for a hider who can escape the search region (Q322755) (← links)
- Edge search number of cographs (Q415273) (← links)
- A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources (Q438788) (← links)
- Searching for an axis-parallel shoreline (Q443717) (← links)
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Screening and hiding versus search (Q486938) (← links)
- Simultaneous approximation of multi-criteria submodular function maximization (Q489121) (← links)
- Ambush and active search in multistage predator-prey interactions (Q493043) (← links)
- Infinite linear programming and online searching with turn cost (Q515543) (← links)
- Deterministic symmetric rendezvous with tokens in a synchronous torus (Q540154) (← links)
- A foraging problem: sit-and-wait versus active predation (Q621674) (← links)
- A new approach to Gal's theory of search games on weakly Eulerian networks (Q692087) (← links)
- The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
- Rendezvous of heterogeneous mobile agents in edge-weighted networks (Q896142) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← 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)
- Equilibria of two-sided matching games with common preferences (Q1041991) (← links)
- On asynchronous rendezvous in general graphs (Q1625604) (← links)
- A general framework for searching on a line (Q1676358) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- On the approximation ratio of the random Chinese postman tour for network search (Q1694817) (← links)
- The search value of a set (Q1699127) (← links)
- Event-driven optimal control for a robotic exploration, pick-up and delivery problem (Q1730345) (← links)
- Gathering of robots in a ring with mobile faults (Q1731510) (← links)
- Continuous patrolling and hiding games (Q1735165) (← links)
- A search problem on a bipartite network (Q1735184) (← links)
- Linear search by a pair of distinct-speed robots (Q1755792) (← links)
- Finding a hider by an unknown deadline (Q1785459) (← links)
- Reaching a target in the plane with no information (Q1799599) (← links)
- Patrolling a perimeter (Q1926970) (← links)
- Mapping simple polygons: how robots benefit from looking back (Q1939675) (← links)
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains (Q1946493) (← links)
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols (Q1954192) (← links)
- Lower bounds for searching robots, some faulty (Q1981629) (← links)
- Gossiping by energy-constrained mobile agents in tree networks (Q1998846) (← links)
- Searching for multiple objects in multiple locations (Q1999403) (← links)
- Search on a line with faulty robots (Q2010608) (← links)
- Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
- Dynamic coordination via organizational routines (Q2074051) (← links)
- A normal form game model of search and pursuit (Q2087115) (← links)
- A game theoretic approach to a problem in polymatroid maximization (Q2098075) (← links)
- Weighted group search on a line \& implications to the priority evacuation problem (Q2098167) (← links)
- Graph exploration by energy-sharing mobile agents (Q2117723) (← links)
- Pebble guided near optimal treasure hunt in anonymous graphs (Q2117728) (← links)
- A symbolic programming approach to the rendezvous search problem (Q2120120) (← links)
- Social distancing, gathering, search games: mobile agents on simple networks (Q2128973) (← links)