Rendezvous Search with Revealed Information: Applications to the Line

DOI10.1239/jap/1175267160zbMath1171.90415OpenAlexW2076140982MaRDI QIDQ5443698

Steven Alpern

Publication date: 22 February 2008

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/jap/1175267160

zbMATH Keywords

team theorycommon interest game

Mathematics Subject Classification ID

Search theory (90B40)

Related Items (1)

Ten Open Problems in Rendezvous Search

Cites Work

• The theory of search games and rendezvous.
• Learning How to Cooperate: Optimal Play in Repeated Coordination Games
• Improved Bounds for the Symmetric Rendezvous Value on the Line
• Note: Two rendezvous search problems on the line
• Rendezvous search on a graph
• Rendezvous search when marks are left at the starting points
• Rendezvous Search on the Line with More Than Two Players
• The Rendezvous Search Problem
• Rendezvous Search on the Line with Distinguishable Players
• Rendezvous Search on the Line with Indistinguishable Players
• The rendezvous problem on discrete locations

This page was built for publication: Rendezvous Search with Revealed Information: Applications to the Line