Vector linear programming in zero-sum multicriteria matrix games
From MaRDI portal
Publication:2564178
DOI10.1007/BF02192644zbMath0866.90139MaRDI QIDQ2564178
Francisco Ramón Fernández García, Justo Puerto
Publication date: 7 January 1997
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items (23)
Set-valued TU-games ⋮ Multi-choice linear programming for matrix game ⋮ Formulating generalised `goal games' against nature: An illustration from decision-making under uncertainty in agriculture ⋮ A set optimization approach to zero-sum matrix games with multi-dimensional payoffs ⋮ Unnamed Item ⋮ Nondominated Nash points: application of biobjective mixed integer programming ⋮ On minimax and Pareto optimal security payoffs in multicriteria games ⋮ The Shapley-Shubik index for multi-criteria simple games ⋮ Pareto-optimal security strategies in matrix games with fuzzy payoffs ⋮ Nondominated equilibrium solutions of a multiobjective two-person nonzero-sum game and corresponding mathematical programming problem ⋮ The concept of proper solution in linear programming ⋮ Core solutions in vector-valued games ⋮ The structure of the set of equilibria for two person multicriteria games. ⋮ Multicriteria goal games ⋮ A BARGAINING MODEL FOR FINITE N-PERSON MULTI-CRITERIA GAMES ⋮ Multi-Criteria Simple Games ⋮ A general model for voting systems with multiple alternatives ⋮ Solving multi-objective matrix games with fuzzy payoffs through the lower limit of the possibility degree ⋮ Intuitionistic-fuzzy goals in zero-sum multi criteria matrix games ⋮ Multi-objective fuzzy bi-matrix game model: a multicriteria non-linear programming approach ⋮ Pareto-optimal security strategies as minimax strategies of a standard matrix game ⋮ Generalized maximin solutions in multicriteria bargaining ⋮ Folk theorems in multicriteria repeated \(N\)-person games.
Cites Work
- Unnamed Item
- Technical note: Games with vector payoffs
- A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games
- Solution concepts in two-person multicriteria games
- A unified approach for characterizing Pareto optimal solutions of multiobjective optimization problems: The hyperplane method
- Some minimax theorems in vector-valued functions
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Generating all maximal efficient faces for multiple objective linear programs
- Domination structures and multicriteria problems in N-person games
- Existence of a Pareto equilibrium
- Linear Multiparametric Programming by Multicriteria Simplex Method
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
This page was built for publication: Vector linear programming in zero-sum multicriteria matrix games