The Library
Searching symmetric networks with Utilitarian-Postman paths
Tools
Alpern, Steve, Baston, Vic and Gal, Shmuel (2009) Searching symmetric networks with Utilitarian-Postman paths. Networks, Vol.53 (No.4). pp. 392-402. doi:10.1002/net.20314 ISSN 0028-3045.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1002/net.20314
Abstract
We introduce the notion of a Utilitarian Postman (UP) path on a network Q as one which minimizes the expected time required to find a random (uniformly distributed) point, and show that UP paths must be used in a minimax search of a symmetric network. For any network Q, one may consider the zero-sum search game Γ(Q) in which the (minimizing) Searcher picks a unit speed path S(t) in Q, the Hider picks a point H in Q, and the payoff is the meeting time T = min{t : S(t) = H}. We show first that if Q is symmetric (edge and vertex transitive), then it is optimal for the Hider to pick H uniformly in Q, so that the Searcher must follow a UP path. We then show that if Q is symmetric of odd degree, with n vertices and m unit length edges, the value V of Γ(Q) satisfies , with equality if and only if (*): Q has a path P = v1, v2,…,vn−1 of distinct vertices, such that the edge set Q′ = Q−∪(v2i,v2i+1) is connected. In this case, there is a UP path for Q consisting of P followed by an Eulerian path E of Q′. The condition (*) is satisfied by many symmetric graphs, including all complete graphs, complete bipartite graphs, hypercube graphs, high valency graphs, and the Petersen graph. We know of no odd degree symmetric graph not satisfying (*). © 2009 Wiley Periodicals, Inc. NETWORKS, 2009
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Divisions: | Faculty of Social Sciences > Warwick Business School > Operational Research & Management Sciences Faculty of Social Sciences > Warwick Business School |
||||
Journal or Publication Title: | Networks | ||||
Publisher: | John Wiley & Sons Inc. | ||||
ISSN: | 0028-3045 | ||||
Official Date: | 2009 | ||||
Dates: |
|
||||
Volume: | Vol.53 | ||||
Number: | No.4 | ||||
Page Range: | pp. 392-402 | ||||
DOI: | 10.1002/net.20314 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |