Ten Open Problems in Rendezvous Search

DOI10.1007/978-1-4614-6825-7_14zbMATH Open1356.91014OpenAlexW2237699881MaRDI QIDQ2961406FDOQ2961406

Authors: Steve Alpern 

Publication date: 20 February 2017

Published in: Search Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-6825-7_14

Recommendations

• The Rendezvous Search Problem
• Note: Two rendezvous search problems on the line
• Rendezvous Search with Revealed Information: Applications to the Line
• Rendezvous search on a graph
• Rendezvous search on the interval and the circle
• Rendezvous problem
• A symbolic programming approach to the rendezvous search problem

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Cites Work

• The theory of search games and rendezvous.
• Asynchronous deterministic rendezvous in graphs
• Deterministic rendezvous in graphs
• Rendezvous search on labeled networks
• Minimax Rendezvous on the Line
• The Rendezvous Search Problem
• Title not available (Why is that?)
• The rendezvous problem on discrete locations
• How to meet in anonymous network
• Title not available (Why is that?)
• The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
• The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
• Mobile Agent Rendezvous in a Synchronous Torus
• Rendezvous search on the interval and the circle
• Improved Bounds for the Symmetric Rendezvous Value on the Line
• Rendezvous Search: A Personal Perspective
• Principles of Distributed Systems
• Alternating search at two locations
• Note: Two rendezvous search problems on the line
• Rendezvous search on a star graph with examination costs
• Rendezvous Search on the Line with More Than Two Players
• Rendezvous Search on the Line with Distinguishable Players
• Rendezvous Search on the Line with Indistinguishable Players
• Asymmetric rendezvous search on the circle
• Optimal symmetric rendezvous search on three locations
• Asymmetric Rendezvous on the Line Is a Double Linear Search Problem
• Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting
• Rendezvous of three agents on the line
• Line-of-sight rendezvous
• Rendezvous Search with Revealed Information: Applications to the Line

Cited In (9)

• God save the queen
• New results on rendezvous search on the interval
• Rendezvous problem
• Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract)
• Search-and-rescue rendezvous
• Algorithms for \(p\)-Faulty Search on a half-line
• Evacuating from \(\ell_p\) unit disks in the wireless model
• Rendezvous Search: A Personal Perspective
• Applications of search in biology: some open problems

This page was built for publication: Ten Open Problems in Rendezvous Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961406)