The average tree value for hypergraph games

We consider transferable utility cooperative games (TU games) with limited cooperation introduced by a hypergraph communication structure, the so-called games. A structure is given collection of coalitions, hyperlinks hypergraph, for which it assumed that only coalitions are or connected unions able to cooperate and realize their worth. introduce average tree value games, assigns each player player’s marginal contributions respect particular rooted spanning trees study its properties. show stable on subclass superadditive cycle-free also provide axiomatizations subclasses hypertree cycle