A distributed algorithm is described for finding a common fixed point of a family of m > 1 nonlinear maps Mi : Rn → Rn assuming that each map is a paracontraction. The common fixed point is asynchronously computed in real time by m agents assuming each agent i knows only Mi, the current estimates of the fixed point generated by its neighbors, and nothing… (More)