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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
