A decentralized cooperative strategy for cooperative search by a team of mobile agents (of particular interest is the case of unmanned air vehicles) is presented, where cooperation is accomplished by having each agent take into account the other agents' possible actions. The preliminary associated analysis shows that the proposed strategy guarantees a complete global search of the environment, gives a lower bound on the search time and shows that it is finite.