In multicriteria optimization, a compromise solution is a feasible solution whose cost vector minimizes the distance to the ideal point w.r.t. a given norm. The coordinates of the ideal point are given by the optimal values for the single optimization problem for each criterion. We show that the concept of compromise solutions fits nicely into the existing notion of Pareto optimality: For a hug...

We study when two-member household choice behavior is compatible with Pareto optimality. We ask when an external observer of household choices, who does not know the individuals’ preferences, can rationalize the choices as being Pareto-optimal. Our main contribution is to reduce the problem of rationalization to a graph-coloring problem. As a result, we obtain simple tests for Pareto optimal ch...

We consider the notion of Pareto optimality under the assumption that only the pairwise majority relation is known and show that the set of necessarily Pareto optimal alternatives coincides with the McKelvey uncovered set. As a consequence, the McKelvey uncovered set constitutes the coarsest Pareto optimal majoritarian social choice function. Moreover, every majority relation is induced by a pr...