Fixed point search in a discrete monotone decreasing operator

Abstract

This paper analyzes the computational complexity of fixed point search in a nonincreasing additive operator. A power algorithm determining a fixed point is proposed. A constructive proof of fixed point existence is given in a special case of a nonincreasing additive bounded-variation operator. Possible applications include voluntary financing of public good, the Cournot oligopoly and others.