Skip to main content
Log in

Approximations and Well-Posedness in Multicriteria Games

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

First, sufficient conditions of minimal character are given which guarantee the sequential closedness of the set-valued function defined by the parametric weak-multicriteria Nash equilibria of a parametric multicriteria game, that is to say: a convergent sequence of parametric weak-multicriteria Nash equilibria, corresponding to an approximate value of the parameter x n , converges to a weak-multicriteria Nash equilibrium corresponding to the limit value x of the sequence (x n ) n . Then, approximating sequences and parametrically well-posedness for a multicriteria game are introduced and investigated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Altman, E., T. Boulogne, R. El-Azouzi, and T. Jimenez. (2000). “A Survey on Networking Games in Telecomunications.” working paper.

  • Aubin, J.P. (1978). Mathematical Methods in Games and Economic Theory. North Holland, Amsterdam.

  • Basar, T. and G.J. Olsder. (1995). Dynamic Noncooperative Game Theory. New York: Academic press.

    Google Scholar 

  • Bednarczuk, E. (1994). “An Approach to Well-Posedness in Vector Optimization: Consequences to Stability.” Control and Cybernetics 23, 107–122.

    Google Scholar 

  • Blackwell, O. (1956). “An Analog of the Minimax Theorem for Vector Payoffs.” Pacific Journal of Mathematics 6, 1–8.

    Google Scholar 

  • Berge, C. (1959). Espaces Topologiques. Fonctions Multivoques, Dunod, Paris.

  • Borm, P., F. van Hegen, and S.H. Tijs. (1999). “A Perfectness Concept for Multicriteria Games.” Math. Methods Oper. Res. 49, 401–412.

    Article  Google Scholar 

  • Cavazzuti, E. and J. Morgan. (1983). “Well-Posed Saddle Point Problems.” Lecture Notes in Pure and Applied Mathematics, New York: Marcel Dekker, vol. 86, pp. 61–76.

    Google Scholar 

  • Corley, H.W. (1985). “Games with Vector Payoffs.” Journal ofOptimization Theory and Applications 42, 491–498.

    Article  Google Scholar 

  • Del Prete, I., M.B. Lignola, and J. Morgan. (2003). “New Concepts of Well-Posedness for Optimization Problems with Variational Inequality Constraints.” Journal of Inequalities in Pure and Applied Mathematics 4, Issue 1.

  • Dontchev, A.L. and T. Zolezzi. (1993). “Well-Posed Optimization Problems.” Lecture Notes in Mathematics, Springer Verlag, vol. 1543.

  • Fernandez, F.R., L. Monroy, and J. Puerto. (1998). “Games with Vector Payoffs.” Journal of OptimizationTheory and Applications 99, 195–208.

    Google Scholar 

  • Fernandez, F.R., M.A. Hinojosa, and J. Puerto. (2002). “Games with Vector Payoffs.” Journal of OptimizationTheory and Applications 112, 331–360.

    Article  Google Scholar 

  • Ghose, D.B. (1991). “A Necessary and Sufficient Condition forPareto-Optimal Security Strategies in Multicriteria Matrix Games.” Journal of Optimization Theory and Applications 68, 468–480.

    Google Scholar 

  • Ghose, D. and U.R. Prasad. (1989). “Solution Concepts inTwo-Persons Multicriteria Games.” Journal of Optimization Theory andApplications 63, 167–188.

    Article  Google Scholar 

  • Huang, X.X. (2000). “Extended Well-Posedness Properties of Vector Optimization Problems.” Journal of Optimization Theoryand Applications 106, 165–182.

    Article  Google Scholar 

  • Huang, X.X. (2001). “Well-Posedness of Perturbed Vector Optimization Problems in a Vector-Valued Variational Principle.” Journal of Optimization Theory and Applications 108, 671–686.

    Article  Google Scholar 

  • Kuratowski, K. (1968). Topology, New York-London: Academic Press.

    Google Scholar 

  • Lignola, M.B. and J. Morgan. (1994). “Semicontinuities and Episemicontinuity: Equivalence and Applications.” Bollettino Unione Matematica Italiana 7(8-B), 1–16.

    Google Scholar 

  • Lignola, M.B. and J. Morgan. (2000). “Well-Posedness for Optimization Problems with Constraints Defined by Variational Inequalities Having a Unique Solution.” Journal of Global Optimization 16, 57–67.

    Article  Google Scholar 

  • Lignola, M.B. and J. Morgan. (2002). “Approximate Solutions and α-Well-Posedness for Variational Inequalities and Nash Equilibria.” Decision and Control in Management Science. Kluwer Academic Publishers, pp. 367–378.

  • Loridan, P. (1995). “Well-Posedness in Vector Optimization.”In R. Lucchetti and J. Revalski (Eds.), Recent Developments in Well-Posed Variational Problems. Kluwer Academic Publishers, pp. 171–192.

  • Loridan, P. and J. Morgan. (2000). “Convergence of Approximate Solutions and Values in Parametric Vector Optimization.” In F. Giannessi (eds.) Vector Variational Inequalities and Vector Equilibria. Kluwer Academic Publishers, pp. 335–350.

  • Luc, D.T. (1989). “Theory of Vector Optimization.” Lecture Notes in Economics and Mathematical Systems. Berlin: Springer-Verlag, vol. 319.

    Google Scholar 

  • Lucchetti, R., F. Patrone, S.H. Tijs, and A. Torre. (1987). “Continuity Properties of Solution Concepts for Cooperative Games.” OR Spektrum 9, 101–107.

    Article  Google Scholar 

  • Margiocco, M., F. Patrone, and L. Pusillo Chicco. (1997). “A New Approach to Tikhonov Well-Posedness for Nash Equilibria.” Optimization 40, 385–400.

    Google Scholar 

  • Monroy, L. and A. Marmol. (1999). “Aplicaciones Economicas,Avances en Teoria de Juegos con Aplicaciones Economicas y Sociales.” J.M. Bilbao and F.R. Fernandez (eds.) Universidad de Sevilla, pp. 73– 88.

  • Monroy, L. and J. Puerto. (1999). “Juegos Matriciales Vectoriales.” In J.M. Bilbao and F.R. Fernandez (eds.), Avances en teoria de juegos con aplicaciones economicas y sociales. Universidad de Sevilla, pp. 27–53.

  • Morgan, J. (1989). Constrained Well-Posed Two-Level Optimization Problems, In F. Clarke, V. Demianov and F. Giannessi (eds.), Nonsmooth Optimization and Related Topics. Ettore Majorana International Sciences Series, New York: Plenum Press, pp. 307–326.

    Google Scholar 

  • Owen, G. (1993) (III ed.), Game Theory. New York: Academic Press.

    Google Scholar 

  • Puerto, J. and F.R. Fernandez. (1995). Solution Concepts Based on Security Levels in Constrained Multicriteria Convex Games. Opsearch vol. 32, pp. 16–30.

    Google Scholar 

  • Puerto, J. and F.R. Fernandez. (1999). “A Refinement of the Concept of Equilibrium in Multiple Objective Games.” In W. Takahashi and T. Tanaka (eds.) Nonlinear Analysis and Convex Analysis. World Scientific, Singapore.

    Google Scholar 

  • Sawaragi, Y., H. Nakayama, and T. Tanino. (1985). Theory of Multiobjective Optimization. Academic Press Inc.

  • Selten, R. (1975). “Reexamination of the Perfectness Concept for Equilibrium Points in Extensive Games.” International Journal on Game Theory 4, 25–55.

    Article  Google Scholar 

  • Shapley, L.S. (1959). “Equilibrium Points in Games with Vector Payoffs.” Naval research Logistics Quarterly 6, 57–61.

    Google Scholar 

  • Singh, C. and N. Rueda. (1994). “Constrained Vector Valued Games andMultiobjective Minmax Programming.” Opsearch 31(2), 144–154.

    Google Scholar 

  • Staib, T. (1988). “On Two Generalizations of Pareto Minimality.” Journal of Optimization Theory and Applications 59, 289–306.

    Google Scholar 

  • Szidarovszky, F., M.E. Gershon, and L. Duckstein. (1986). Techniques for Multiobjective Decision Making in Systems Management. Elsevier,Amsterdam.

    Google Scholar 

  • Tykhonov, A.N. (1966). “On the Stability of the Functional Optimization Problem.” U.S.S.R. Computational Math. and Math. Phys. 6(4), 26–33.

    Google Scholar 

  • van Damme, E. (1987). Stability and Perfection of Nash Equilibria. Springer-Verlag.

  • Wang, S.Y. (1993). “Existence of a Pareto Equilibrium.” Journal of Optimization Theory and Applications 79, 373–386.

    Article  Google Scholar 

  • Yang, H. and J. Yu (2002). “Essential Components of the Set of Weakly Pareto-Nash Equilibrium Points.” Applied Mathematics Letters 15, 553–560.

    Article  Google Scholar 

  • Yu, P.L. (1979). “Second-Order Game Problems: Decision Dynamicsin Gaming Phenomena.” Journal of Optimization Theory and Applications 27, 147–166.

    Article  Google Scholar 

  • Yu, J. and G.X.-Z. Yuan. (1998). “The Study of Pareto Equilibria for Multiobjective Games by Fixed Point and Ky Fan Minmax Inequality Methods.” Computers Math. Applic. 35, 17–24.

    Article  Google Scholar 

  • Yuan, X.Z. and E. Tarafdar. (1996). “Non-Compact Pareto Equilibria for Multiobjective games.” Journal of Math. Analysis andApplications 204, 156–163.

    Article  Google Scholar 

  • Zeleny, M. (1976). “Game with Multiple Payoffs.” Intern.Journal of Game Theory 4, 179–191.

    Article  Google Scholar 

  • Zolezzi, T. (1995). “Wellposed Criteria in Optimization with Application to the Calculus of Variations.” Non-linear Analysis TMA 25, 437–453.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jacqueline Morgan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Morgan, J. Approximations and Well-Posedness in Multicriteria Games. Ann Oper Res 137, 257–268 (2005). https://doi.org/10.1007/s10479-005-2260-9

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-005-2260-9

Keywords

Navigation