This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. Z. Belen'kii, V. A. Volkonskii, S. A. Ivankov, et al., Iterative Methods in Game Theory and Programming [in Russian], Nauka, Moscow (1974).
F. Mirzoakhmedov and S. P. Uryas'ev, “Method of nonsmooth optimization with adaptive step adjustment in the deterministic and stochastic cases,” Preprint Inst. Kibern. Akad. Nauk Ukr. SSR, No. 81-61, Kiev (1981), pp. 1–27.
A. S. Nemirovskii and D. B. Yudin, “Cesaro convergence of the gradient method for approximating saddle points of convex—concave functions,” Dokl. Akad. Nauk SSSR,239, No. 5, 1056–1059 (1978).
J. Nash, “Infinite games,” in: Matrix Games [Russian translation], Fizmatgiz, Moscow (1961), pp. 205–221.
S. P. Uryas'ev, “Step adjustment for direct methods of stochastic programming,” Kibernetika, No. 6, 96–98 (1980).
Yu. Yermoliev and A. Papin, “An approach to simulating international oil trade,” Working Paper, Int. Inst. for Applied Systems Analysis, Laxenburg Austria (May 1981).
I. B. Rosen, “Existence and uniqueness of equilibrium point for concave N-person games,” Econometrica,33, No. 3, 520–534 (1965).
Additional information
Translated from Kibernetika, No. 3, pp. 85–88, May–June, 1982.
Rights and permissions
About this article
Cite this article
Ermol'ev, Y.M., Uryas'ev, S.P. Nash equilibrium in n-person games. Cybern Syst Anal 18, 367–372 (1982). https://doi.org/10.1007/BF01069765
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069765