Rational Multi-Agent Search

Abstract

We study games in which players search for an optimal action profile. All action profiles are either a success, with a payoff of one, or a failure, with a payoff of zero. Players do not know the location of success profiles; instead each player is privately informed about the marginal distribution of success profiles over his actions. We characterize optimal joint search strategies.Search, Decentralization, Symmetry