A COMMON FIXED POINT THEOREM WITH APPLICATIONS IN DYNAMIC PROGRAMMING

Abstract

In this paper, we introduce the concept of compatible mappings and weakly compatible mappings by using pseudometrics, give a common fixed point theorem for two pairs of weakly compatible mappings, and discuss the existence and uniqueness of common solutions for several classes of system of functional equations arising in dynamic programming.