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.
Shapley, Lloyd S., On the Accessibility of Fixed Points. Santa Monica, CA: RAND Corporation, 1981. https://www.rand.org/pubs/notes/N1736.html. Also available in print form.
Shapley, Lloyd S., On the Accessibility of Fixed Points, Santa Monica, Calif.: RAND Corporation, N-1736-NSF, 1981. As of September 09, 2021: https://www.rand.org/pubs/notes/N1736.html