Lipschitz Kernel of a Closed Set-Valued Map

This paper deals with Lipschitz selections of set-valued maps with closed graphs. First, we characterize Lipschitzianity of a closed set-valued map in the differential games framework in terms of a discriminating property of its graph. This allows us to consider the -Lipschitz kernel of a given set-valued map as the largest -Lipschitz closed set-valued map contained in the initial one, to derive an algorithm to compute the collection of Lipschitz selections, and to extend the Pasch–Hausdorff envelope to set-valued maps.