Minimax Rendezvous on the Line

DOI10.1137/S036301299427816XMaRDI QIDQ4715971zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

rendezvous searchminimax version

Mathematics Subject Classification ID

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

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

Cited in

(27)

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

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)