论文信息 - Copositive-plus Lemke algorithm solves polymatrix games

Copositive-plus Lemke algorithm solves polymatrix games

A problem in visual labeling and artificial neural networks, equivalent to finding Nash equilibria for polymatrix n-person games, may be solved by the copositive-plus Lemke algorithm. Analysis suggests efficiency improves Howson's recursive method by O(n^-^1) and is same order as Eaves' L"2-formulation. Method extends to any dynamical system p' = Rp + c, Ap @? q, p >= 0.

Steven W. Zucker | Douglas A. Miller | S. Zucker | Douglas A. Miller

[1] K. Schittkowski,et al. NONLINEAR PROGRAMMING , 2022 .

[2] G. Dantzig,et al. COMPLEMENTARY PIVOT THEORY OF MATHEMATICAL PROGRAMMING , 1968 .

[3] B. Curtis Eaves,et al. Polymatrix Games with Joint Constraints , 1973 .

[4] Christos H. Papadimitriou,et al. The complexity of recognizing polyhedral scenes , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[5] J. Farkas. Theorie der einfachen Ungleichungen. , 1902 .

[6] J. Howson. Equilibria of Polymatrix Games , 1972 .

[7] C. E. Lemke,et al. Bimatrix Equilibrium Points and Mathematical Programming , 1965 .

[8] C. E. Lemke,et al. Equilibrium Points of Bimatrix Games , 1964 .

[9] B. Eaves. On Quadratic Programming , 1971 .

[10] Steven W. Zucker,et al. Two Stages of Curve Detection Suggest Two Styles of Visual Computation , 1989, Neural Computation.

[11] Steven W. Zucker,et al. On the Foundations of Relaxation Labeling Processes , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12] Katta G. Murty,et al. Linear complementarity, linear and nonlinear programming , 1988 .

[13] J. Nash. NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

[14] D. Kinderlehrer,et al. An introduction to variational inequalities and their applications , 1980 .

[15] Robert Wilson,et al. Computing Equilibria of N-Person Games , 1971 .

[16] B. Eaves. The Linear Complementarity Problem , 1971 .