A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games
From MaRDI portal
(Redirected from Publication:912005)
Recommendations
- Pareto-optimal security strategies as minimax strategies of a standard matrix game
- An existence theorem for a Pareto equilibrium
- Solution concepts based on security levels in constrained multicriteria convex games
- On minimax and Pareto optimal security payoffs in multicriteria games
- Vector linear programming in zero-sum multicriteria matrix games
Cites work
- scientific article; zbMATH DE number 4070626 (Why is no real title available?)
- scientific article; zbMATH DE number 3568424 (Why is no real title available?)
- scientific article; zbMATH DE number 3078986 (Why is no real title available?)
- An analog of the minimax theorem for vector payoffs
- Convex Analysis
- Dynamic noncooperative game theory
- 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
- Optimal control of systems with multiple criteria when disturbances are present
- Solution concepts in two-person multicriteria games
- Some minimax theorems in vector-valued functions
- Technical note: Games with vector payoffs
Cited in
(17)- Multicriteria dynamic games with random horizon
- Multicriteria dynamic games with asymmetric horizons
- Refinement of pure Pareto Nash equilibria in finite multicriteria games using preference relations
- Dynamic multicriteria games with asymmetric players
- A set optimization approach to zero-sum matrix games with multi-dimensional payoffs
- Multicriteria goal games
- Approximations and well-posedness in multicriteria games
- Pareto-optimal security strategies in matrix games with fuzzy payoffs
- Solutions of dynamic multicriteria games: classical and untraditional approaches
- Nondominated Nash points: application of biobjective mixed integer programming
- Numerical computation of multi-goal security strategies
- Properly efficient Nash equilibrium in multicriteria noncooperative games
- Nondominated equilibrium solutions of a multiobjective two-person nonzero-sum game and corresponding mathematical programming problem
- Pareto-optimal security strategies as minimax strategies of a standard matrix game
- Vector linear programming in zero-sum multicriteria matrix games
- On minimax and Pareto optimal security payoffs in multicriteria games
- Solution concepts in continuous-kernel multicriteria games
This page was built for publication: A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q912005)
