Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Bukhtoyarov S. E., Emelinev V. A., “Konechnye koalitsionnye igry: parametrizatsiya printsipa optimalnosti (“ot Pareto do Nesha”) i ustoichivost obobschenno-effektivnykh situatsii”, Dokl. HAH Belarusi, 46:6 (2002), 36–38 | MR | Zbl
[2] Bukhtoyarov S. E., Emelinev V. A., Stepanishina Yu. V., “Voprosy ustoichivosti vektornykh diskretnykh zadach s parametricheskim printsipom optimalnosti”, Kibernetika i sistemnyi analiz, 2003, no. 4, 155–166 | MR | Zbl
[3] Nesh Dzh., “Beskoalitsionnye igry”, Matrichnye igry, 1961, 205–221, Fizmatgiz, M.
[4] Leontev V. K., “Ustoichivost v lineinykh diskretnykh zadachakh”, Probl. kibernetiki, 35, 1979, 169–184 | MR
[5] Emelichev V. A., Podkopaev D. P., “O kolichestvennoi mere ustoichivosti vektornoi zadachi tselochislennogo programmirovaniya”, Zh vychisl. matem. i matem. fiz., 38:11 (1998), 1801–1805 | MR | Zbl
[6] Emelichev V. A., Girlich E., Nikulin Yu., Podkopaev D. P., “Stability and regularization of vector problem of integer linear programming”, Optimization, 51:4 (2002), 645–676 | DOI | MR | Zbl
[7] Podinovskii V. V., Nogin V. D., Pareto-optimalnye resheniya mnogokriterialnykh zadach, Nauka, M., 1982 | MR
[8] Bukhtoyarov S. E., Kuzmin K. G., “On stability in game problems of finding Nash set”, Comput. Sci. J. of Moldova, 12:3 (2004), 381–388 | MR