Solution concepts in continuous-kernel multicriteria games
From MaRDI portal
This paper considers nonzero-sum multicriteria games with continuous kernels. Solution concepts based on the notions of Pareto optimality, equilibrium, and security are extended to these games. Separate necessary and sufficient conditions and existence results are presented for equilibrium, Pareto-optimal response, and Pareto-optimal security strategies of the players.
Recommendations
Cites work
- A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games
- An analog of the minimax theorem for vector payoffs
- Duality theory in multiobjective programming
- Dynamic noncooperative game theory
- scientific article; zbMATH DE number 3225772 (Why is no real title available?)
- scientific article; zbMATH DE number 3078986 (Why is no real title available?)
- Maximal vectors and multi-objective optimization
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- Scalarization in vector optimization
- Solution concepts in two-person multicriteria games
- Some minimax theorems in vector-valued functions
- Technical note: Games with vector payoffs
Cited in
(6)- Extensions of solution concepts by means of muliplicative \(\epsilon\)-tax games
- Solution concepts in two-person multicriteria games
- Solution concepts based on security levels in constrained multicriteria convex games
- On minimax and Pareto optimal security payoffs in multicriteria games
- Pareto-minimal solutions for large scale continuous static games (LSCSG).
- scientific article; zbMATH DE number 902728 (Why is no real title available?)
This page was built for publication: Solution concepts in continuous-kernel multicriteria games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915662)
