Abstract
We analyze a dynamic game in which agents strategically search for a prize/reward of known value when they cannot observe the search of others. In every period the rivals decide how much to search. The prize goes to the player who finds it first unless there is simultaneous discovery, in which case the reward is destroyed. In the unique symmetric open loop Nash equilibrium all players receive an expected payoff of zero. A third party could however increase welfare and avoid some search duplication by allocating search zones, even if these exclusive search zones are non-binding.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
