One class of simultaneous pursuit games
N. Yu. SatimovNational University of Uzbekistan, Vuzgorodok, Tashkent, 100174, Republic of UzbekistanGafurjan IbragimovInstitute of Mathematics and Information Technologies, ul. Dorman yuli 29, Tashkent, 100125, Republic of Uzbekistan
ABI
Abstract
Let A and B be given convex closed bounded nonempty subsets in a Hilbert space H; let the first player choose points in the set A and let the second one do those in the set B. We understand the payoff function as the mean value of the distance between these points. The goal of the first player is to minimize the mean value, while that of the second player is to maximize it. We study the structure of optimal mixed strategies and calculate the game value.
Topics
Identifiers
Citations and references
Cited by 010 references
Metrics — AkademScholar · Coming soon