We prov the existence of the limit of the values of finitely repeated ( resp., discounted) absorbing games with incomplete information on one side, as the number of repetitions goes to infinity ( resp., the discount factor goes to zero). The main tool is the study of the Shapley operator, for which the value of the lambda-discounted game is a fixed point, and of its derivative with respect to lambda.