Pages that link to "Item:Q912005"

The following pages link to A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games (Q912005):

Displaying 16 items.

• Pareto-optimal security strategies in matrix games with fuzzy payoffs (Q409727) (← links)
• Approximations and well-posedness in multicriteria games (Q816521) (← links)
• Properly efficient Nash equilibrium in multicriteria noncooperative games (Q890178) (← links)
• Solution concepts in continuous-kernel multicriteria games (Q915662) (← links)
• Multicriteria goal games (Q1275712) (← links)
• Pareto-optimal security strategies as minimax strategies of a standard matrix game (Q1306667) (← links)
• Refinement of pure Pareto Nash equilibria in finite multicriteria games using preference relations (Q1615979) (← links)
• A set optimization approach to zero-sum matrix games with multi-dimensional payoffs (Q1631178) (← links)
• Nondominated Nash points: application of biobjective mixed integer programming (Q1653352) (← links)
• Solutions of dynamic multicriteria games: classical and untraditional approaches (Q2034846) (← links)
• Multicriteria dynamic games with asymmetric horizons (Q2104306) (← links)
• Multicriteria dynamic games with random horizon (Q2117644) (← links)
• Dynamic multicriteria games with asymmetric players (Q2149610) (← links)
• On minimax and Pareto optimal security payoffs in multicriteria games (Q2408652) (← links)
• Nondominated equilibrium solutions of a multiobjective two-person nonzero-sum game and corresponding mathematical programming problem (Q2465466) (← links)
• Vector linear programming in zero-sum multicriteria matrix games (Q2564178) (← links)