Rendezvous Search: A Personal Perspective

From MaRDI portal
Revision as of 06:33, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3635138

DOI10.1287/opre.50.5.772.363zbMath1163.91324OpenAlexW1969585469MaRDI QIDQ3635138

Steven Alpern

Publication date: 3 July 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.50.5.772.363




Related Items (26)

A symbolic programming approach to the rendezvous search problemByzantine gathering in networksSocial distancing, gathering, search games: mobile agents on simple networksRendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine FaultsOptimal rendezvous on a line by location-aware robots in the presence of spies*Byzantine gathering in polynomial timeEntangled rendezvous: a possible application of Bell non-locality for mobile agents on networksGathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move ModelTen Open Problems in Rendezvous SearchUnnamed ItemGathering of robots on meeting-points: feasibility and optimal resolution algorithmsA common notion of clockwise can help in planar rendezvousDifferent Speeds Suffice for Rendezvous of Two Agents on Arbitrary GraphsSearch-and-rescue rendezvousFailure of common knowledge of language in common-interest communication gamesLine-of-sight rendezvousDeterministic symmetric rendezvous with tokens in a synchronous torusGathering in the plane of location-aware robots in the presence of spiesSynchronous Rendezvous for Location-Aware AgentsAsynchronous approach in the plane: a deterministic polynomial algorithmDynamic coordination via organizational routinesEquilibria of two-sided matching games with common preferencesSearching a Variable Speed NetworkRendezvous search with markers that can be dropped at chosen timesStatic search games played over graphs and general metric spacesFast rendezvous on a cycle by agents with different speeds




This page was built for publication: Rendezvous Search: A Personal Perspective