Rendezvous search on a star graph with examination costs

DOI10.1016/J.EJOR.2006.06.017MaRDI QIDQ872266zbMATH OpenOpenAlexFDO

Authors 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

applied probabilitysearch theorygroup decisions and negotiations

Mathematics Subject Classification ID

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

Recommendations

• Rendezvous search on a graph
• Publication:4489244
• The Rendezvous Search Problem
• Rendezvous search on the line with bounded resources: Expected time minimization
• On the probability of rendezvous in graphs
• Rendezvous search on labeled networks
• Rendezvous search on the edges of platonic solids: optimal waiting probabilities and multi-step strategies
• Deterministic rendezvous in graphs

Cites work

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

Cited in

(5)

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

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

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