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

A search game on a cyclic graph

Author

Listed:
  • Kensaku Kikuta

Abstract

There is a finite cyclic graph. The hider chooses one of all nodes except the specified one, and he hides an (immobile) object there. At the beginning the seeker is at the specified node. After the seeker chooses an ordering of the nodes except the specified one, he examines each nodes in that order until he finds the object, traveling along edges. It costs an amount when he moves from a node to an adjacent one and also when he checks a node. While the hider wishes to maximize the sum of the traveling costs and the examination costs which are required to find the object, the seeker wishes to minimize it. The problem is modeled as a two‐person zero‐sum game. We solve the game when unit costs (traveling cost + examination cost) have geometrical relations depending on nodes. Then we give properties of optimal strategies of both players. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.

Suggested Citation

  • Kensaku Kikuta, 2004. "A search game on a cyclic graph," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(7), pages 977-993, October.
    • Handle: RePEc:wly:navres:v:51:y:2004:i:7:p:977-993
    DOI: 10.1002/nav.20025
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20025
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.20025?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
    ---><---

    References listed on IDEAS

    as
    1. Udo Lössner & Ingo Wegener, 1982. "Discrete Sequential Search with Positive Switch Cost," Mathematics of Operations Research, INFORMS, vol. 7(3), pages 426-440, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. 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.
    2. 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.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Steven M. Shechter & Farhad Ghassemi & Yasin Gocgun & Martin L. Puterman, 2015. "Technical Note—Trading Off Quick versus Slow Actions in Optimal Search," Operations Research, INFORMS, vol. 63(2), pages 353-362, April.
    2. Kensaku Kikuta & William H. Ruckle, 1994. "Initial point search on weighted trees," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(6), pages 821-831, October.
    3. Davood Shiri & Vahid Akbari, 2021. "Online Failure Diagnosis in Interdependent Networks," SN Operations Research Forum, Springer, vol. 2(1), pages 1-14, March.
    4. Stanley J. Benkoski & Michael G. Monticino & James R. Weisinger, 1991. "A survey of the search theory literature," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 469-494, August.
    5. Baston, Vic & Kikuta, Kensaku, 2019. "A search problem on a bipartite network," European Journal of Operational Research, Elsevier, vol. 277(1), pages 227-237.
    6. Lau, Haye & Huang, Shoudong & Dissanayake, Gamini, 2008. "Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times," European Journal of Operational Research, Elsevier, vol. 190(2), pages 383-397, October.

    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:51:y:2004:i:7:p:977-993. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.