The average tree value for hypergraph games

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