IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v29y2001i4p533-542.html
   My bibliography  Save this article

On the optimality of a simple strategy for searching graphs

Author

Listed:
  • Shmuel Gal

    (The University of Haifa, Haifa 31905, Israel)

Abstract

Consider a search game with an immobile hider in a graph. A Chinese postman tour is a closed trajectory which visits all the points of the graph and has minimal length. We show that encircling the Chinese postman tour in a random direction is an optimal search strategy if and only if the graph is weakly Eulerian (i.e it consists of several Eulerian curves connected in a tree-like structure).

Suggested Citation

  • Shmuel Gal, 2001. "On the optimality of a simple strategy for searching graphs," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(4), pages 533-542.
    • Handle: RePEc:spr:jogath:v:29:y:2001:i:4:p:533-542
    Note: Received: December 1999/Revised version: September 2000
    as

    Download full text from publisher

    File URL: http://link.springer.de/link/service/journals/00182/papers/1029004/10290533.pdf
    Download Restriction: Access to the full text of the articles in this series is restricted
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Francis Bloch & Bhaskar Dutta & Marcin Dziubi´nski, 2024. "Strategic hiding and exploration in networks," Working Papers 112, Ashoka University, Department of Economics.
    2. Lidbetter, Thomas, 2020. "Search and rescue in the face of uncertain threats," European Journal of Operational Research, Elsevier, vol. 285(3), pages 1153-1160.
    3. Steve Alpern, 2011. "Find-and-Fetch Search on a Tree," Operations Research, INFORMS, vol. 59(5), pages 1258-1268, October.
    4. Lidbetter, Thomas, 2017. "On the approximation ratio of the Random Chinese Postman Tour for network search," European Journal of Operational Research, Elsevier, vol. 263(3), pages 782-788.
    5. Lidbetter, Thomas, 2013. "Search games with multiple hidden objects," LSE Research Online Documents on Economics 55103, London School of Economics and Political Science, LSE Library.
    6. 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.
    7. Jotshi, Arun & Batta, Rajan, 2008. "Search for an immobile entity on a network," European Journal of Operational Research, Elsevier, vol. 191(2), pages 347-359, December.

    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:spr:jogath:v:29:y:2001:i:4:p:533-542. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.