Optimal symmetric rendezvous search on three locations
DOI10.1287/MOOR.1110.0528zbMATH Open1238.91033DBLPjournals/mor/Weber12OpenAlexW2143553428WikidataQ56171918 ScholiaQ56171918MaRDI QIDQ2884307FDOQ2884307
Authors: Richard Weber 
Publication date: 24 May 2012
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/467d7fbe317dcc00f3ae9986a794223d9115aa88
Recommendations
Search theory (90B40) Cooperative games (91A12) Semidefinite programming (90C22) Pursuit and evasion games (49N75) Decentralized systems (93A14) Positional games (pursuit and evasion, etc.) (91A24)
Cited In (13)
- Strategy for quickest second meeting of two agents in two locations
- The rendezvous problem on discrete locations
- A symbolic programming approach to the rendezvous search problem
- Social distancing, gathering, search games: mobile agents on simple networks
- Codes, lower bounds, and phase transitions in the symmetric rendezvous problem
- Search-and-rescue rendezvous
- Rendezvous search with markers that can be dropped at chosen times
- On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph
- Ten Open Problems in Rendezvous Search
- Optimal trade-off between speed and acuity when searching for a small object
- On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous
- Asymmetric rendezvous search on the circle
- Spatio-temporal dynamics of random transmission events: from information sharing to epidemic spread
This page was built for publication: Optimal symmetric rendezvous search on three locations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884307)
