  We consider a discrete-time dynamic search game in which a number of players
compete to find an invisible object that is moving according to a time-varying
Markov chain. We examine the subgame perfect equilibria of these games. The
main result of the paper is that the set of subgame perfect equilibria is
exactly the set of greedy strategy profiles, i.e. those strategy profiles in
which the players always choose an action that maximizes their probability of
immediately finding the object. We discuss various variations and extensions of
the model.
