Axiomatic characterization of maximin and lexicographically maximin solutions of bargaining schemes

$N$-person bargaining problems with compact sets of feasible outcomes are considered. axiomatic characterizations of normalized maxmin and lexicographically maxmin solutions of these problems are given.