Abstract Bimatrix games have had theoretical importance and important applications since the very beginning of game theory to date. Pareto optimal strategy vectors represent a reasonable frequently applied solution concept (basically in cooperative approach). Particularly, it often arises whether non-cooperative can be improved sense, i.e. is or not. However, concrete cases may hard determine a...

In recent years, there has been an increasing interest in studying the develpoment of optimality conditions for nondifferentiable multiobjective programming problems. Many authors established and employed some different Kuhn and Tucker type necessary conditions or other type necessary conditions to research optimal solutions; see [1–27] and references therein. In [7], Lai and Ho used the Pareto...

At the end of their debate with R. H. Str&, F. M. Fisher and J. Rothenberg make a plea for going beyond the Pareto optimality criterion in analyzing issues in welfare eoonomies.l The present study is in the spirit of this plea: an attempt is made in this paper to derive bounds on the optimal distribution of income under a particular set of value judgments. Because of a general reluctance of eco...

We consider a general multiobjective optimization problem with five basic optimality principles: efficiency, weak and proper Pareto optimality, strong efficiency and lexicographic optimality. We generalize the concept of tradeoff directions defining them as some optimal surface of appropriate cones. In convex optimization, the contingent cone can be used for all optimality principles except lex...

Reallocating resources to get mutually beneficial outcomes is a fundamental problem in various multi-agent settings. In the first part of the paper we focus on the setting in which agents express additive cardinal utilities over objects. We present computational hardness results as well as polynomial-time algorithms for testing Pareto optimality under different restrictions such as two utility ...