Minimax Rendezvous on the Line

DOI10.1137/S036301299427816XzbMATH Open0857.90063OpenAlexW2007267487MaRDI QIDQ4715971FDOQ4715971

Authors: Wei Shi Lim, Steve Alpern 

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

Recommendations

• Rendezvous Search on the Line with More Than Two Players
• Rendezvous Search on the Line
• Note: Two rendezvous search problems on the line
• Rendezvous Search on the Line with Distinguishable Players

zbMATH Keywords

rendezvous searchminimax version

Mathematics Subject Classification ID

Search theory (90B40) Positional games (pursuit and evasion, etc.) (91A24)

Cited In (28)

• Time versus space trade-offs for rendezvous in trees
• Deterministic polynomial approach in the plane
• Note: Two rendezvous search problems on the line
• How to meet asynchronously at polynomial cost
• Deterministic rendezvous in infinite trees
• Anonymous meeting in networks
• Time versus cost tradeoffs for deterministic rendezvous in networks
• Attribute-efficient learning of Boolean functions from Post closed classes
• Fast rendezvous with advice
• How to meet in anonymous network
• Use of information, memory and randomization in asynchronous gathering
• Gathering despite mischief
• Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks
• 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
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• Rendezvous in networks in spite of delay faults
• Asynchronous Deterministic Rendezvous on the Line
• Rendezvous search on the line with bounded resources: Expected time minimization
• Asynchronous deterministic rendezvous in graphs
• Rendezvous of heterogeneous mobile agents in edge-weighted networks
• Ten Open Problems in Rendezvous Search
• A further study on weak Byzantine gathering of mobile agents
• Rendezvous of three agents on the line
• Many-player rendezvous search: Stick together or split and meet?
• Want to gather? No need to chatter!
• Static search games played over graphs and general metric spaces

This page was built for publication: Minimax Rendezvous on the Line

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