A new allocation rule for cooperative games with hypergraph communication structure

A new allocation rule was proposed by splitting the original game into a game between hyperlinks and games within them. A special case of cooperative game on flower type hypergraphs is investigated. The proposed allocation rule has been generalized for games with a communication structure represented by acyclic reduced hypergraphs and was illustrated by examples.