Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
From MaRDI portal
Publication:4210191
DOI10.1137/S0363012996314130zbMath0909.90277OpenAlexW1971467559MaRDI QIDQ4210191
Publication date: 21 September 1998
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0363012996314130
Cooperative games (91A12) Search theory (90B40) 2-person games (91A05) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (23)
A symbolic programming approach to the rendezvous search problem ⋮ Asynchronous deterministic rendezvous in graphs ⋮ Rendezvous search on labeled networks ⋮ Rendezvous in networks in spite of delay faults ⋮ Fast rendezvous with advice ⋮ Rendezvous of heterogeneous mobile agents in edge-weighted networks ⋮ How to meet when you forget: log-space rendezvous in arbitrary graphs ⋮ Deterministic rendezvous in infinite trees ⋮ Rendezvous search when marks are left at the starting points ⋮ Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains ⋮ A common notion of clockwise can help in planar rendezvous ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ Search-and-rescue rendezvous ⋮ Line-of-sight rendezvous ⋮ Time versus space trade-offs for rendezvous in trees ⋮ GAMES OF CROWDING ⋮ Asynchronous Deterministic Rendezvous on the Line ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Synchronous Rendezvous for Location-Aware Agents ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ Deterministic rendezvous with different maps ⋮ Rendezvous search with markers that can be dropped at chosen times ⋮ Unnamed Item
This page was built for publication: Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
