A formal proof of convergence of a class of algorithms for reducing inconsistency of pairwise comparisons (pc) method is presented. The design of such algorithms is proposed. The convergence of the algorithms justifies making an inference that iterated modifications of the pc matrix made by human experts should also converge. This is instrumental for credibility of practical applications of the pc method.