Solutions for cooperative games with a major player and a hierarchical structure

In this paper, we adapt two well-known solutions for cooperative games with an exogenously given cycle-free communication graph structure (the average tree solution and the Myerson value) to the game with a major player. A comparative analysis of such solutions is carried out for special graphs — a star and a complete $k$-ary tree.