Mar 30, 2014 · These combinatorial structures have a direct relationship with graph communication situations and conference structures à la Myerson.

These combinatorial structures have a direct relationship with graph communication situations and conference structures a` la Myerson. Char- acterizations of ...

Characterizations of the Myerson value in this context are provided using the concept of basis for union stable systems. Moreover, TU-games restricted by union ...

of the Myerson value to union stable structures. Theorem 3.2 The Myerson value is the unique fair allocation rule on USN. Proof. (a) Uniqueness: Let (N; v;F) ...

We study cooperation structures with the following property: Given any two feasible coalitions with non-empty intersection, its union is a feasible ...

TU-games restricted by union stable systems generalizes graph-restricted games and games with permission structures and has a direct relationship with graph ...

Aug 9, 2022 · In this work, an axiomatization of a new value for union stable structures, efficient Myerson value, is shown by average equity, ...

In this paper, the set of feasible coalitions which models the partial coop- eration will be given by a union stable system. These systems contain, as ...

TL;DR: In this article, the position value for games in which partial cooperation exists, that is based on a union stable coalition system, is defined, and ...

Abstract In this work, an axiomatization of a new value for union stable structures, efficient Myerson value, is shown by average equity, redundant.