Minimax Rendezvous on the Line
From MaRDI portal
Publication:4715971
DOI10.1137/S036301299427816XzbMath0857.90063OpenAlexW2007267487MaRDI QIDQ4715971
Publication date: 20 February 1997
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s036301299427816x
Related Items (26)
Attribute-efficient learning of Boolean functions from Post closed classes ⋮ Asynchronous deterministic rendezvous in graphs ⋮ Rendezvous of three agents on the line ⋮ Rendezvous in networks in spite of delay faults ⋮ Price of asynchrony in mobile agents computing ⋮ Rendezvous search on a star graph with examination costs ⋮ Integer programming models and algorithms for the graph decontamination problem with mobile agents ⋮ Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks ⋮ 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 ⋮ Ten Open Problems in Rendezvous Search ⋮ Many-player rendezvous search: Stick together or split and meet? ⋮ How to meet in anonymous network ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ Time versus space trade-offs for rendezvous in trees ⋮ How to meet asynchronously at polynomial cost ⋮ Asynchronous Deterministic Rendezvous on the Line ⋮ Note: Two rendezvous search problems on the line ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Rendezvous search on the line with bounded resources: Expected time minimization ⋮ Unnamed Item ⋮ Deterministic polynomial approach in the plane ⋮ Static search games played over graphs and general metric spaces ⋮ Anonymous meeting in networks
This page was built for publication: Minimax Rendezvous on the Line
