Abstract
The simultaneous zero-sum search game on the sphere C is considered. The hider chooses the system of l points x = (x1,…, xk), x1 ∈ C, i = 1, …, k. The point chosen by the hider is called “discovered” if it lies in the r - neighbourhood of the points chosen by the searcher. The payoff of the searcher is equal to the number of discovered points. The case with a moving searcher is also considered. The optimal strategy of the searcher consists in the random throwing of the “discovery region” on the sphere according to the probability distribution generated by the kynematic measure. The optimal mixed strategy of the hider and the value of the game are found.
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.
