A search game on the union of graphs with immobile hider

Ljiljana Pavlović

Naval Research Logistics (NRL), 1995, vol. 42, issue 8, 1177-1189

Abstract: We consider a search game for an immobile hider on one arc of the union of n graphs joined at one or two points. We evaluate a lower bound on the value of a strategy for the hider on this union. When we have identical graphs, we give the conditions under which the value of the strategy for the hider on this union is greater than or equal to n times the value of this strategy on one graph. We also solve search games on graphs, consisting of an odd number of arcs, each of length one, joining two points. © 1995 John Wiley & Sons, Inc.

Date: 1995
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199512)42:83.0.CO;2-R

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:42:y:1995:i:8:p:1177-1189

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().