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

condition satisfied by a large class of directed acyclic graphs that is sufficient for balancedness of the associated DAG … 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 …

its pairs that belong to connected sectors. We provide a sufficient condition on the weights to guarantee balancedness 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 …