Path-following algorithms have proved practical for the solution of fixed-point problems arising in economics and game theory. But the value of the methodology is diminished by the possibility of multiple solutions, since there is no guarantee of finding more than one solution even if many paths are traced. This Note describes a way of transforming problems so that the paths are modified while the solutions remain unchanged. As a result, previously inaccessible solutions may become accessible. It is shown that for any piecewise-linear problem in general position there is a solution-preserving transformation that makes all solutions simultaneously accessible.
This report is part of the RAND Corporation note series. The note was a product of the RAND Corporation from 1979 to 1993 that reported other outputs of sponsored research for general distribution.
Permission is given to duplicate this electronic document for personal use only, as long as it is unaltered and complete. Copies may not be duplicated for commercial purposes. Unauthorized posting of RAND PDFs to a non-RAND Web site is prohibited. RAND PDFs are protected under copyright law. For information on reprint and linking permissions, please visit the RAND Permissions page.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.