Pages that link to "Item:Q1416614"
From MaRDI portal
The following pages link to The theory of search games and rendezvous. (Q1416614):
Displayed 45 items.
- Asynchronous Deterministic Rendezvous on the Line (Q3599098) (← links)
- A Jamming Game in Wireless Networks with Transmission Cost (Q3614955) (← links)
- A cooperative game in search theory (Q3621934) (← links)
- Delay-Predictability Trade-offs in Reaching a Secret Goal (Q4969343) (← links)
- (Q5002836) (← links)
- Querying with Uncertainty (Q5056054) (← links)
- Searching for a Non-adversarial, Uncooperative Agent on a Cycle (Q5056057) (← links)
- (Q5090453) (← links)
- (Q5091040) (← links)
- Competitive Searching for a Line on a Line Arrangement. (Q5091041) (← links)
- Energy Consumption of Group Search on a Line (Q5092340) (← links)
- Improved Lower Bounds for Shoreline Search (Q5100947) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)
- Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)
- (Q5131476) (← links)
- Zero-Sum Two Person Games (Q5149734) (← links)
- How to meet asynchronously at polynomial cost (Q5176086) (← links)
- Searching a Variable Speed Network (Q5244863) (← links)
- On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous (Q5245013) (← links)
- Linear Search with Terrain-Dependent Speeds (Q5283387) (← links)
- Edge Search Number of Cographs in Linear Time (Q5321690) (← links)
- Search games on networks with travelling and search costs and with arbitrary searcher starting points (Q5326807) (← links)
- Rendezvous Search with Revealed Information: Applications to the Line (Q5443698) (← links)
- Mobile Agent Rendezvous in a Ring Using Faulty Tokens (Q5445769) (← links)
- Control Sequencing in a Game of Identity Pursuit-Evasion (Q5501220) (← links)
- Spatio-temporal dynamics of random transmission events: from information sharing to epidemic spread (Q5870453) (← links)
- Byzantine fault tolerant symmetric-persistent circle evacuation (Q5918713) (← links)
- Gathering in the plane of location-aware robots in the presence of spies (Q5918903) (← links)
- Near-gathering of energy-constrained mobile agents (Q5919042) (← links)
- Time-energy tradeoffs for evacuation by two robots in the wireless model (Q5919064) (← links)
- Gathering in dynamic rings (Q5919424) (← links)
- Byzantine fault tolerant symmetric-persistent circle evacuation (Q5925703) (← links)
- Almost universal anonymous rendezvous in the plane (Q6046947) (← links)
- Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs (Q6075758) (← links)
- Connected search for a lazy robber (Q6080862) (← links)
- A nearly optimal randomized algorithm for explorable heap selection (Q6085985) (← links)
- The search and rescue game on a cycle (Q6100190) (← links)
- Triangle evacuation of 2 agents in the wireless model (extended abstract) (Q6111999) (← links)
- Search on a Line by Byzantine Robots (Q6114825) (← links)
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q6116185) (← links)
- Weighted online search (Q6133641) (← links)
- Collaborative dispersion by silent robots (Q6155249) (← links)
- Optimal circle search despite the presence of faulty robots (Q6161451) (← links)
- Delivery to safety with two cooperating robots (Q6169542) (← links)
- Algorithms for \(p\)-Faulty Search on a half-line (Q6174824) (← links)