@techreport{oai:tsukuba.repo.nii.ac.jp:00027482,
 author = {IGARASHI, Ayumi and YAMAMOTO, Yoshitsugu and 山本, 芳嗣},
 month = {Jun},
 note = {This paper considers cooperative transferable utility games with graph structure,
called graph games. A graph structure restricts the set of possible coalitions of players, so that
players are able to cooperate only if they are connected in the graph. Recently the average tree
solution has been proposed for arbitrary graph games by Herings et al. The average tree solution
is the average of some specific marginal contribution vectors, and was shown to belong to the core
if the game exhibits link-convexity. In this paper the main focus is placed on the relationship
between the core and the average tree solution, and the following results were obtained. Firstly,
it was shown that some marginal contribution vectors do not belong to the core even though the
game is link-convex. Secondly, an alternative condition to link-convexity was given. Thirdly, it
was proven that for cycle-complete graph games the average tree solution is an element of the
core if the game is link-convex.},
 title = {Average Tree Solution and Core for Cooperative Games with Graph Structure},
 year = {2012}
}