Template-Type: ReDIF-Paper 1.0 Author-Name: Francis Bloch Author-Name-First: Francis Author-Name-Last: Bloch Author-Email: francis.bloch@univ-paris1.fr Author-Workplace-Name: Universite´ Paris 1 and Paris School of Economics Author-Name: Bhaskar Dutta Author-Name-First: Bhaskar Author-Name-Last: Dutta Author-Email: bhaskar.dutta@ashoka.edi.in Author-Workplace-Name: Ashoka University Author-Name: Marcin Dziubi´nski Author-Name-First: Marcin Author-Name-Last: Dziubi´nski Author-Email: m.dziubinski@mimuw.edu.pl Author-Workplace-Name: Institute of Informatics, University of Warsaw Title: Strategic hiding and exploration in networks 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 connected network and the location of an object. 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. length: 28 Creation-Date: 20240412 Revision-Date: Publication-Status: File-URL:https://dp.ashoka.edu.in/ash/wpaper/paper112_0.pdf File-Format: Application/pdf Number: 112 Keywords: Network exploration Keywords: networks Keywords: Strategic hiding Handle: RePEc:ash:wpaper:112