Metric characterizations of Tikhonov well-posedness in value. (English) Zbl 0915.90271

Summary: We discuss and give metric characterizations of Tikhonov well-posedness in value for Nash equilibria. Roughly speaking, Tikhonov well-posedness of a problem means that approximate solutions converge to the true solution when the degree of approximation goes to zero. If we add to the condition of \(\varepsilon\)-equilibrium that of \(\varepsilon\)-closeness in value to some Nash equilibrium, we obtain Tikhonov well-posedness in value, which we have defined in a previous paper. This generalization of Tikhonov well-posedness has the remarkable property of ordinality; namely, it is preserved under monotonic transformations of the payoffs. We show that a metric characterization of Tikhonov well-posedness in value is not possible unless the set of Nash equilibria is compact and nonempty.


91A05 2-person games
Full Text: DOI


[1] Margiocco, M., Patrone, F., and Pusillo Chicco, L., A New Approach to Tikhonov Well-Posedness for Nash Equilibria, Optimization, Vol. 40, pp. 385–400, 1997. · Zbl 0881.90136
[2] Furi, M., and Vignoli, A., About Well-Posed Optimization Problems for Functionals on Metric Spaces, Journal of Optimization Theory and Applications, Vol. 5, pp. 225–229, 1970. · Zbl 0177.12904
[3] Cavazzuti, E., and Morgan, J., Well-Posed Saddle-Point Problems, Optimization Theory and Algorithms, Edited by J. B. Hiriart-Urruty, W. Oettli, and J. Stoer, Lecture Notes in Pure and Applied Mathematics, M. Dekker, New York, New York, Vol. 86, pp. 61–76, 1983. · Zbl 0519.49015
[4] Patrone, F., Well-Posed Minimum Problems for Preorders, Rendiconti del Seminario Matematico dell’Universit√† di Padova, Vol. 84, pp. 109–121, 1990. · Zbl 0724.49004
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.