Abstract:
The polytopes of $(0,1)$-normalized convex and $1$-convex (dual simplex) $n$-person TU-games, as well as monotonic big boss games are considered. The problems of characterization of extreme points of polytopes of $1$-convex games, symmetric convex games and big boss games, symmetric w.r.t. coalition of powerless agents, are solved. For other polytopes, the description of subsets of extreme points is given. Tab. 2, bibliogr. 15.
Keywords:TU-game, balancedness, $1$-convexity, convexity, big boss game.