Rendezvous Search on the Line with More Than Two Players
From MaRDI portal
Publication:4367230
Recommendations
Cited in
(22)- Rendezvous search on the line with bounded resources: Expected time minimization
- Social distancing, gathering, search games: mobile agents on simple networks
- Rendezvous search on the interval and the circle
- Optimal symmetric rendezvous search on three locations
- Codes, lower bounds, and phase transitions in the symmetric rendezvous problem
- Ten Open Problems in Rendezvous Search
- Rendezvous in Higher Dimensions
- Rendezvous Search on the Labeled Line
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
- Note: Two rendezvous search problems on the line
- Many-player rendezvous search: Stick together or split and meet?
- A rendezvous-evasion game on discrete locations with joint randomization
- Rendezvous of three agents on the line
- Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting
- Rendezvous Search on the Line
- Minimax Rendezvous on the Line
- scientific article; zbMATH DE number 1908188 (Why is no real title available?)
- Rendezvous Search on the Line with Indistinguishable Players
- Rendezvous Search with Revealed Information: Applications to the Line
- Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks
- On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph
- Rendezvous search on a sphere: the astronaut problem
This page was built for publication: Rendezvous Search on the Line with More Than Two Players
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367230)