IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v31y2014i03ns0217595914500134.html
   My bibliography  Save this article

A Search Game With Unknown Examination Costs And Travel Times

Author

Listed:
  • KENSAKU KIKUTA

    (School of Business Administration, University of Hyogo, Gakuen-nishi 8-2-1, Nishi-ku, Kobe 651-2197, Japan)

Abstract

A search game on a finite and complete graph is studied between a (immobile) hider and a seeker. A strategy for the hider is to choose a node where he hides, except for a specified node. A strategy for the seeker is an ordering of nodes in which the seeker starts at the specified node, examines each node in that order until he finds the hider, traveling along edges. Associated with an examination of a node is the examination cost, and associated with a movement from a node to a node is a traveling cost. These costs are unknown for both players when they choose strategies. They know only probability laws of them. While the hider wishes to maximize the expectation of the sum of these costs which are required to find the hider, the seeker wishes to minimize it. The game is solved when the nodes are classified into two groups depending on the examination costs, and the edges are classified into three groups depending on both costs.

Suggested Citation

  • Kensaku Kikuta, 2014. "A Search Game With Unknown Examination Costs And Travel Times," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 31(03), pages 1-20.
    • Handle: RePEc:wsi:apjorx:v:31:y:2014:i:03:n:s0217595914500134
    DOI: 10.1142/S0217595914500134
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595914500134
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595914500134?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
    ---><---

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

    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:wsi:apjorx:v:31:y:2014:i:03:n:s0217595914500134. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.