Suppes-Sen Dominance is a commonly accepted criterion of impartiality in distributive justice. Mariotti (1999) characterized the Nash bargaining solution using Nash (1950)’s Scale Invariance (SI) axiom and an axiom named Suppes-Sen Proofness (SSP) that embodies the Suppes-Sen principle. By adding a relative equity component to SSP, we …rst consider a stronger version of of it, the Strong Suppes...

designer is solving an optimization problem, which involves different disciplines and where all design criteria have to be optimized simultaneously. Mathematically this problem can be reduced to a vector optimization problem. The solution of this problem is not unique and is represented by a Pareto surface in the space of the objective functions. Once a Pareto solution is obtained, it may be ve...

In this paper we introduce general prenormal and normal structures in Banach spaces that cover conventional concepts of normals to arbitrary closed sets under minimal requirements. Based on these structures, we establish new abstract versions of the extremal principle in variational analysis, which plays a fundamental role in many applications. The main applications of this paper concern necess...

In this paper we introduce a definition of approximate Pareto efficient solution as well necessary condition for such solutions in the multiobjective setting on Riemannian manifolds. We also propose an inexact proximal point method nonsmooth optimization context by using notion solution. The main convergence result ensures that each cluster (if any) any sequence generated is critical point. Fur...

Pareto efficiency is a widely used property in solution concepts for cooperative and non–cooperative game–theoretic settings and, more generally, in multi–objective problems. However, finding or even approximating (when the objective functions are not convex) the Pareto curve is hard. Most of the literature focuses on computing concise representations to approximate the Pareto curve or on explo...

We consider a situation, in which a regulator believes that constraining a complex good created jointly by competitive agents, is socially desirable. Individual levels of outputs that generate the constrained amount of the externality can be computed as a Pareto efficient solution of the agents’ joint utility maximisation problem. However, generically, a Pareto efficient solution is not an equi...

We study two related versions of the no-impatience postulate in the context of transitive and reflexive relations on infinite utility streams which are not necessarily complete. Both are excluded by the traditional (weak) anonymity axiom. We show explicit social welfare relations satisfying Strong Pareto and the weaker version of noimpatience that are compatible with continuity in all the tradi...