extreme points of two closely related polytopes that are assigned to a digraph. The first polytope is the set of all sharing …

-free communication structure, it is the solution proposed by Herings, van der Laan and Talman (2008). We introduce the notion of link-convexity …, under which the game is shown to have a non-empty core and the average tree solution lies in the core. In general, link-convexity … is weaker than convexity. For games with a cycle-free communication structure, link-convexity is even weaker than super-additivity. …

convexity and efficient set characterization results on SD efficiency of a given portfolio relative to adiversified set of …