axiomatization of the Shapley value that the requirements of Core Compatibility, Equal Treatment Property and Strong Monotonicity are …

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

games with non-empty cores this means that the core can be reached via a bounded sequence of blocks. …

structure core, the minimal dominant set returns this core. We provide an algorithm to find the minimal dominant set. …

between the methods. There are some properties that an allocation method should satisfy: full allocation, core compatibility … methods from the point of view if they are satisfying core compatibility. We test this with simulation where we add to the … existing literature that we test core compatibility with different assumptions on returns: on normal and t-distributed returns …

, hence agreements must be stable against both types of deviations. The appropriate extension of the classicakl core concept …, the Sustainable Core, is defined for this new setup to test the stability of allocations in such a complex environment. A … achieved by choosing an element in the Sustainable Core. …

In this paper we investigate some new applications of Scarf's Lemma. First, we introduce the notion of fractional core … a joint activity may be different. We show that a stable allocation can be found by the Scarf algorithm in this case as …