In this paper we describe the extreme points of two closely related polytopes that are assigned to a digraph. The first polytope is the set of all sharing vectors (elements from the unit simplex) such that each node gets at least as much as each of its successors. The second one is the set of...

In this paper we describe the extreme points of two closely related polytopes that are assigned to a digraph. The first polytope is the set of all sharing vectors (elements from the unit simplex) such that each node gets at least as much as each of its successors. The second one is the set of...

See also the publication in 'Journal of Mathematical Economics', 2008, 44, 1114-1125. <P> In this paper we describe the extreme points of two closely related polytopes that are assigned to a digraph. The first polytope is the set of all sharing vectors (elements from the unit simplex) such that...</p>