A. G. Chentsov
The problem on constructing hereditary multiselectors of the qiven set-valued mapping (SVM) is considered. The solution is defined in terms of fixed points of the operator on the space of SVM. This operator defines the procedure of a compression of multifunctions and generates the iterated process of constructing hereditary multiselectors. In the case of problems of differential games theory the considered method realizes the transformation of a pseudostrategy solving the initial problem into the corresponding quasistrategy. The used scheme is a variant of the well known programmed iterations method.