We study values for transferable utility games enriched by a communication graph. The most well-known such values are component-efficient and characterized by some link-deletion property. We study efficient extensions of such values: for a given component-efficient value, we look for a value...

AMS classification: 91A12

For n-person bargaining problems the family of proportional solutions (introduced and characterized by Kalai in 1977) is generalized to bargaining problems with non-convex payo sets. The so-called "ecient proportional solutions" are characterized axiomatically using natural extensions of the...