IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v42y1995i8p1177-1189.html
   My bibliography  Save this article

A search game on the union of graphs with immobile hider

Author

Listed:
  • Ljiljana Pavlović

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.

Suggested Citation

  • Ljiljana Pavlović, 1995. "A search game on the union of graphs with immobile hider," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(8), pages 1177-1189, December.
    • Handle: RePEc:wly:navres:v:42:y:1995:i:8:p:1177-1189
    DOI: 10.1002/1520-6750(199512)42:83.0.CO;2-R
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199512)42:83.0.CO;2-R
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199512)42:83.0.CO;2-R?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Steve Alpern & Thomas Lidbetter, 2014. "Searching a Variable Speed Network," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 697-711, August.
    2. Steve Alpern & Thomas Lidbetter, 2015. "Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object," Operations Research, INFORMS, vol. 63(1), pages 122-133, February.
    3. Steve Alpern, 2011. "Find-and-Fetch Search on a Tree," Operations Research, INFORMS, vol. 59(5), pages 1258-1268, October.
    4. Duvocelle, Benoit & Flesch, János & Staudigl, Mathias & Vermeulen, Dries, 2022. "A competitive search game with a moving target," European Journal of Operational Research, Elsevier, vol. 303(2), pages 945-957.
    5. Garrec, Tristan & Scarsini, Marco, 2020. "Search for an immobile hider on a stochastic network," European Journal of Operational Research, Elsevier, vol. 283(2), pages 783-794.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:42:y:1995:i:8:p:1177-1189. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.