Abstract

This paper adapts two well-known solutions of 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. Such solutions are compared with one another for special graphs, namely, for a star and a complete \(k\)-ary tree.

中文翻译：

---

具有主要参与者和层次结构的合作游戏的解决方案

摘要

本文将具有外生的无周期通信图结构（平均树解决方案和Myerson值）的两个合作游戏的著名解决方案应用于具有主要参与者的游戏。对于一种特殊的图形，即对于一个恒星和一个完整的\（k \）- ary树，将这种解决方案相互比较。