SANDWICH METHOD FOR FINDING FIXED-POINTS

被引：37

作者：

KUHN, HW

MACKINNON, JG

机构：

[1] PRINCETON UNIV,PRINCETON,NJ 08540

[2] QUEENS UNIV,KINGSTON,ONTARIO,CANADA

来源：

关键词：

D O I：

10.1007/BF00933874

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：189 / 204

页数：16

共 13 条

[1]

ARROW KJ, 1971, GENERAL COMPETITIVE

[2]

Eaves B.C., 1972, MATHEMATICAL PROGRAM, V3, P225, DOI 10.1007/BF01584991

[3]

Eaves BC, 1972, MATHEMATICAL PROGRAM, V3, P1, DOI [10.1007/BF01584975, DOI 10.1007/BF01584975]

[4]

FISHER ML, 1975, P C COMPUTING FIXED

[5] SIMPLICIAL APPROXIMATION OF FIXED POINTS [J].

KUHN, HW .

[6]

KUHN HW, 1960, IBM J RES DEV, V4, P508

[7] EQUILIBRIUM POINTS OF BIMATRIX GAMES [J].

LEMKE, CE ;

HOWSON, JT .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1964, 12 (02) :413-423

[8]

MACKINNON JG, 1975, P C COMPUTING FIXED

[9]

MERRILL OH, 1972, THESIS U MICHIGAN

[10]

MERRILL OH, 1971, 717 U MICH DEP IND E