The Myerson value for union stable structures
نویسندگان
چکیده
We study cooperation structures with the following property: Given any two feasible coalitions with non-empty intersection, its union is a feasible coalition again. These combinatorial structures have a direct relationship with graph communication situations and conference structures à la Myerson. 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 stable systems generalizes graph-restricted games and games with permission structures. Mathematics Subject Classi...cation 2000: 91A12
منابع مشابه
The Myerson value for union stable
We study cooperation structures with the following property: Given any two feasible coalitions with non-empty intersection, its union is a feasible coalition again. These combinatorial structures have a direct relationship with conference structures la Myerson. Characterizations of the Myer-son value in this context are provided by means of the introduction of the concept of basis for union sta...
متن کاملThe Myerson Value and Superfluous Supports in Union Stable Systems
Cooperative games with partial cooperation cover a wider rank of real word situations than the classic model of cooperative games where every subset of a set of agents can form a coalition to execute the game. In this paper, the set of feasible coalitions which models the partial cooperation will be given by a union stable system. These systems contain, as particular cases, the communication si...
متن کاملThe Myerson value for complete coalition structures
In order to describe partial cooperation structures, this paper introduces complete coalition structures as sets of feasible coalitions. A complete coalition structure has a property that, for any coalition, if each pair of players in the coalition belongs to some feasible coalition contained in the coalition then the coalition itself is also feasible. The union stable structures, which constit...
متن کاملHarsanyi power solutions for games on union stable systems
This paper analyzes Harsanyi power solutions for cooperative games in which partial cooperation is based on union stable systems. These structures contain as particular cases the widely studied communication graph games and permission structures, among others. In this context, we provide axiomatic characterizations of the Harsanyi power solutions which distribute the Harsanyi dividends proporti...
متن کاملOn the Complexity of Computing the Myerson Value by Dividends
An algorithm describes a sequence of operations for solving a computational problem. There are often several algorithms for solving a problem and we are interested in analyzing the computational resources required to calculate the Myerson value. The complexity of a problem is the order of computational resources which are necessary and su¢cient to solve the problem. The algorithmic complexity i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Meth. of OR
دوره 54 شماره
صفحات -
تاریخ انتشار 2001