Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/wiley/the-search-value-of-a-network-9YAvPBKiIq
References (7)
-
(1982)
Ask, Review of "Search Games -
S. Alpern, M. Asic (1982)
Search Games (Shmuel Gal)Siam Review, 24
-
Alpern Alpern, Asic Asic (1982)
Review of “Search Games” by S. GalSIAM Review, 24
-
C. FitzGerald (1979)
The princess and Monster differential game1979 18th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes, 2
-
FitzGerald FitzGerald (1979)
The princess and monster differential gameSIAM J. Control Optimization, 17
-
S. Gal (1979)
Search Games with Mobile and Immobile HiderSiam Journal on Control and Optimization, 17
-
(1982)
Ask, Two search games on graphs. Theoretical Economics Discussion Paper Series, International Center for Economics and Related Disciplines
- Publisher
- Wiley
- Copyright
- Copyright © 1985 Wiley Periodicals, Inc., A Wiley Company
- ISSN
- 0028-3045
- eISSN
- 1097-0037
- DOI
- 10.1002/net.3230150208
- Publisher site
- See Article on Publisher Site
Abstract
Let Q be a connected network with a distinguished (starting) point q0, whose are lengths sum to one. We associate with Q a “search value” V(Q) representing the expected time needed for a searcher, starting at q0 and moving at unit speed, to find a moving hider. We assume neither sees the other until they meet. We demonstrate that the “figure‐eight” network, consisting of two equal loops joined at a central starting point, has a search value not exceeding 15/16. This contradicts a conjecture of Gal that the search value of any network is at least 1. In the other direction, we show that V(Q) ≦ 6kD for a network with k edges and diameter D.
Journal
Networks: An International Journal – Wiley
Published: Jun 1, 1985