Author | Todd, Michael J. author |
---|---|

Title | The Computation of Fixed Points and Applications [electronic resource] / by Michael J. Todd |

Imprint | Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1976 |

Connect to | http://dx.doi.org/10.1007/978-3-642-50327-6 |

Descript | VII, 132 p. online resource |

SUMMARY

Fixed-point algorithms have diverse applications in economics, optimization, game theory and the numerical solution of boundary-value problems. Since Scarf's pioneering work [56,57] on obtaining approximate fixed points of continuous mappings, a great deal of research has been done in extending the applicability and improving the efficiency of fixed-point methods. Much of this work is available only in research papers, although Scarf's book [58] gives a remarkably clear exposition of the power of fixed-point methods. However, the algorithms described by Scarf have been superẽded by the more sophisticated restart and homotopy techniques of Merrill [̃8,̃9] and Eaves and Saigal [1̃,16]. To understand the more efficient algorithms one must become familiar with the notions of triangulation and simplicial approxi- tion, whereas Scarf stresses the concept of primitive set. These notes are intended to introduce to a wider audience the most recent fixed-point methods and their applications. Our approach is therefore via triangu- tions. For this reason, Scarf is cited less in this manuscript than his contri- tions would otherwise warrant. We have also confined our treatment of applications to the computation of economic equilibria and the solution of optimization problems. Hansen and Koopmans [28] apply fixed-point methods to the computation of an invariant optimal capital stock in an economic growth model. Applications to game theory are discussed in Scarf [56,58], Shapley [59], and Garcia, Lemke and Luethi [24]. Allgower [1] and Jeppson [31] use fixed-point algorithms to find many solutions to boundary-value problems

CONTENT

I Brouwerโ{128}{153}s Theorem -- II Some Applications of Brouwerโ{128}{153}s Theorem -- III Triangulations -- IV Algorithms to Find Completely-Labelled Simplices -- V Extensions of Brouwerโ{128}{153}s Theorem -- VI Applications of Kakutaniโ{128}{153}s Theorem and its Extensions -- VII Eavesโ{128}{153} First Algorithm -- VIII Merrillโ{128}{153}s Algorithm -- IX Homotopy Algorithms -- X Triangulations with Continuous Refinement of Grid Size -- XI Measures of Efficiency for Triangulations -- References

Mathematics
Business
Management science
Topology
Mathematics
Topology
Business and Management general