IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v142y2026ics0165489626000569.html

Strategic hiding and exploration in networks

Author

Listed:
  • Bloch, Francis
  • Dutta, Bhaskar
  • Dziubiński, Marcin

Abstract

We propose and study a model of strategic network design and exploration where the hider, subject to a budget constraint restricting the number of links, chooses a network with a distinguished source node and the location of an object in the network, reachable from the source. Meanwhile, the seeker, not observing the network and the location of the object, chooses a network exploration strategy starting at a fixed node in the network. The network exploration follows the expanding search paradigm of Alpern and Lidbetter (2013). We obtain a Nash equilibrium and characterize equilibrium payoffs in the case of linking budget allowing for trees only. We also give an upper bound on the expected number of steps needed to find the hider for the case where the linking budget allows for at most one cycle in the network.

Suggested Citation

  • Bloch, Francis & Dutta, Bhaskar & Dziubiński, Marcin, 2026. "Strategic hiding and exploration in networks," Mathematical Social Sciences, Elsevier, vol. 142(C).
    • Handle: RePEc:eee:matsoc:v:142:y:2026:i:c:s0165489626000569
    DOI: 10.1016/j.mathsocsci.2026.102549
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489626000569
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2026.102549?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;

    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:eee:matsoc:v:142:y:2026:i:c:s0165489626000569. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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.