, under which the game is shown to have a non-empty core and the average tree solution lies in the core. In general, link-convexity …-free communication structure, it is the solution proposed by Herings, van der Laan and Talman (2008). We introduce the notion of link-convexity … is weaker than convexity. For games with a cycle-free communication structure, link-convexity is even weaker than super-additivity. …

, under which the game is shown to have a non-empty core and the average tree solution lies in the core. In general, link-convexity …-free communication structure, it is the solution proposed by Herings, van der Laan and Talman (2008). We introduce the notion of link-convexity … is weaker than convexity. For games with a cycle-free communication structure, link-convexity is even weaker than super-additivity. …

, under which the game is shown to have a non-empty core and the average tree solution lies in the core. In general, link-convexity …-free communication structure, it is the solution proposed by Herings, van der Laan and Talman (2008). We introduce the notion of link-convexity … is weaker than convexity. For games with a cycle-free communication structure, link-convexity is even weaker than super-additivity. …

is the same. We further give weak forms of convexity that are necessary and sufficient conditions for the core stability …

that although the game is not convex its core is always non-empty. Furthermore we provide a painting algorithm for large …

show that in general a DAG-game is not concave, even its core might be empty, but we provide an efficiently verifiable …-game. We introduce a network canonization process and prove various structural results for the core of canonized DAG-games, for … example, we characterize classes of coalitions that have a constant payoff in the core. In addition, we identify a subset of …

strongly balanced and the core is described by means of the cores of the underlying two-sided assignment games associated with … between core and competitive equilibria is established …

pays a unitary cost to obtain this technology. A coalitional cost game can be defined from this situation, and the core of … this game is known to be non- empty. We prove that the core of an information graph game is a von Neumann … the information graph consists of a ring that contains the source, then a stable set always exists and it is the core of a …