Optimal Symmetric Rendezvous Search on Three Locations
From MaRDI portal
Publication:2884307
DOI10.1287/moor.1110.0528zbMath1238.91033DBLPjournals/mor/Weber12OpenAlexW2143553428WikidataQ56171918 ScholiaQ56171918MaRDI QIDQ2884307
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
Semidefinite programming (90C22) Cooperative games (91A12) Search theory (90B40) Decentralized systems (93A14) Pursuit and evasion games (49N75) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (9)
A symbolic programming approach to the rendezvous search problem ⋮ Social distancing, gathering, search games: mobile agents on simple networks ⋮ Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object ⋮ Codes, lower bounds, and phase transitions in the symmetric rendezvous problem ⋮ Ten Open Problems in Rendezvous Search ⋮ Search-and-rescue rendezvous ⋮ On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous ⋮ Rendezvous search with markers that can be dropped at chosen times ⋮ 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
