Rendezvous search on a star graph with examination costs

DOI10.1016/J.EJOR.2006.06.017zbMath1121.90070OpenAlexW2068956636MaRDI QIDQ872266

Kensaku Kikuta, William H. Ruckle

Publication date: 27 March 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.017

zbMATH Keywords

group decisions and negotiationssearch theoryapplied probability

Mathematics Subject Classification ID

Search theory (90B40) Management decision making, including multiple objectives (90B50)

Related Items (5)

A symbolic programming approach to the rendezvous search problem ⋮ Ten Open Problems in Rendezvous Search ⋮ Search-and-rescue rendezvous ⋮ Rendezvous search with markers that can be dropped at chosen times ⋮ Static search games played over graphs and general metric spaces

Cites Work

• A HIDE AND SEEK GAME WITH TRAVELING COST
• Note: Two rendezvous search problems on the line
• Rendezvous search on a graph
• Rendezvous search on labeled networks
• Minimax Rendezvous on the Line
• Approximately optimal one‐dimensional search policies in which search costs vary through time
• The rendezvous problem on discrete locations

This page was built for publication: Rendezvous search on a star graph with examination costs