Generalized maximin solutions in multicriteria bargaining

In this paper we address bargaining games where the agents have to take into account different criteria to value the decisions. We propose the class of generalized maximin solutions, as the natural extension for these games of the maximin solutions in conventional bargaining. In order to refine this solution concept, we define a multicriteria lexicographic partical ordering and present the class of generalized leximin solutions as those that are nondominated with respect to this relation. We establish some properties of these solutions and characterize them as solutions of multicriteria problems.