Sziklai, Balázs; Solymosi, Tamás; Fleiner, Tamás - 2014
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 …