, 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. …

In this paper we establish a relationship between the core cover of a compromise admissiblegame and the core of a … particular bankruptcy game: the core cover of a compromiseadmissible game is, indeed, a translation of the set of coalitional … stable allocations capturedby an associated bankruptcy game. Moreover, we analyze the combinatorial complexity ofthe core …

the core of an ET-game. …

staying with the original outcome with the risk of deviating. Employing this idea to the core leads to a new concept that we … call the risk-based core. We introduce this concept and discuss its properties. We find an inclusion relation between cores … yields many of the familiar inclusion relations as corollaries, while the inclusion of the optimistic core in the optimistic …

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

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

coalitions determine both the core and the nucleolus in monotonic games whenever the core is non-empty. We show how these two …

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 …

The concept of 'the core' originates in cooperative game theory and its introduction to economics in the 1960s as a … questions in economics. Discovery of the core was met with enthusiasm among the community of economic theorists at the time …. However, use of the core eventually waned and the concept faded into the backdrop of economic theory. This paper makes use of …