Showing 1 - 10 of 15
Persistent link: https://www.econbiz.de/10005944944
In a rendezvous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider two seekers in the plane. This is a one sided problem since Seeker 1 begins at a predetermined point O. Seeker 2 begins at one of a finite set of points xi with...
Persistent link: https://www.econbiz.de/10008865319
Persistent link: https://www.econbiz.de/10005330070
Persistent link: https://www.econbiz.de/10007604827
Persistent link: https://www.econbiz.de/10008433277
Persistent link: https://www.econbiz.de/10002207253
Persistent link: https://www.econbiz.de/10007750188
A search game on a finite and complete graph is studied between a (immobile) hider and a seeker. A strategy for the hider is to choose a node where he hides, except for a specified node. A strategy for the seeker is an ordering of nodes in which the seeker starts at the specified node, examines...
Persistent link: https://www.econbiz.de/10010782128
Persistent link: https://www.econbiz.de/10006741140
Persistent link: https://www.econbiz.de/10006417610