| Article ID: | iaor20162301 |
| Volume: | 77 |
| Issue: | 4 |
| Start Page Number: | 708 |
| End Page Number: | 715 |
| Publication Date: | Apr 2016 |
| Journal: | Automation and Remote Control |
| Authors: | Lebedev V, Bashlaeva I |
| Keywords: | optimization |
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.