This collection of articles aspires to be a permanent record of ideas which are likely to become important determinants in the future of management sciences. These papers were initially presented at the first session on Multiple Criteria Decision Making QMCDM) organized under the auspices of The Institute of Management Sciences (TIMS). All works were prepared by leading spokesmen for three generations of OR/MS change agents. Special mention must be made of the dynamic role which Professor Martin K. Starr played in organizing the program of the TIMS XXII International Meeting. In May, 1973, Professor Starr, who was President of TIMS and Program Chairman of the Kyoto conference, requested me to chair the MCDM session. Throughout the long period of formative inter change, Dr. Starr demonstrated his full and continuing support of both the event and the MCDM field. On July 25, 1975, surrounded by the rocky gardens of the Kyoto International Conference Hall (KICH), located on the shore of Takaraga Ike, we engaged in a day-long discussion of MCDM. Our "talk together in Kyoto" was a professional experience of the highest intensity for participants, speakers and audience alike.

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~eded 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.