Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution

DOI10.1137/S0363012996314130MaRDI QIDQ4210191zbMATH OpenOpenAlexFDO

Authors Vic Baston, Shmuel Gal

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

zbMATH Keywords

rendezvouslinear search

Mathematics Subject Classification ID

Search theory (90B40) Cooperative games (91A12) 2-person games (91A05) Positional games (pursuit and evasion, etc.) (91A24)

Recommendations

• Rendezvous Search on the Line with Indistinguishable Players
• Rendezvous Search on the Line with Distinguishable Players
• Rendezvous Search on the Line with More Than Two Players

Cited in

(27)

• How to meet when you forget: log-space rendezvous in arbitrary graphs
• Time versus cost tradeoffs for deterministic rendezvous in networks
• Time versus space trade-offs for rendezvous in trees
• Rendezvous in networks in spite of delay faults
• Line-of-sight rendezvous
• A symbolic programming approach to the rendezvous search problem
• Deterministic rendezvous with different maps
• Synchronous rendezvous for location-aware agents
• Asynchronous Deterministic Rendezvous on the Line
• Rendezvous in planar environments with obstacles and unknown initial distance
• A further study on weak Byzantine gathering of mobile agents
• A common notion of clockwise can help in planar rendezvous
• Search-and-rescue rendezvous
• Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
• Rendezvous Search on the Line with Distinguishable Players
• Rendezvous of heterogeneous mobile agents in edge-weighted networks
• Rendezvous Search on the Line with Indistinguishable Players
• Fast rendezvous with advice
• Rendezvous search when marks are left at the starting points
• Asynchronous deterministic rendezvous in graphs
• Rendezvous search on labeled networks
• Deterministic rendezvous in infinite trees
• Want to gather? No need to chatter!
• Use of information, memory and randomization in asynchronous gathering
• Rendezvous search with markers that can be dropped at chosen times
• Games of crowding
• Gathering despite mischief

This page was built for publication: Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution

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