n-person non-convex bargaining: Efficient proportional solutions

For n-person bargaining problems the family of proportional solutions (introduced and characterized by Kalai) is generalized to bargaining problems with non-convex payoff sets. The so-called ''efficient proportional solutions'' are characterized axiomatically using natural extensions of the original axioms provided by Kalai.