Stable Hedonic Cooperation Structures∗

نویسندگان

  • Guillaume Haeringer
  • Pierre Dehez
  • Claus-Jochen Haake
  • Martin Meier
  • Gisèle Umbhauer
  • Hubert Stahn
چکیده

We consider a model in which players can form links between themselves under mutual agreement, and the set of all pairwise agreements is called a cooperation structure. We stress that we are particularly interested to the case when some players are antagonistic, i.e., that they are separately “desirable” for someone, but “undesirable” when they are together. We define a class of preferences that ensures the stability of cooperation structures, if each player is sensitive to her direct neighbors only. However, it turns out that if players are sensitive to their indirect neighbors, antagonism between player may easily forbid the existence of stable cooperation structures, for a large class of preference profile.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Taxonomy of Myopic Stability Concepts for Hedonic Games

We present a taxonomy of myopic stability concepts for hedonic games in terms of deviations, and discuss the status of the existence problems of stable coalition structures. In particular, we show that contractual strictly core stable coalition structures always exist, and provide su¢ cient conditions for the existence of contractually Nash stable and weak individually stable coalition structur...

متن کامل

Meritocracy, egalitarianism and the stability of majoritarian organizations

Egalitarianism and meritocracy are competing principles to distribute the joint bene…ts of cooperation. We examine the consequences of letting members of society vote between those two principles, in a context where groups of a certain size must be formed in order for individuals to become productive. Our setup induces a hedonic game of coalition formation. We study the existence of core stable...

متن کامل

Individual-based stability in hedonic games depending on the best or worst players

We consider classes of hedonic games in which each player’s preferences over coalition structures are induced by the best player (Band B-hedonic games) or the worst player (Wand W-hedonic games) in his coalition. For these classes, which allow for concise representation, we analyze the computational complexity of deciding the existence of and computing individually stable, Nash stable, and indi...

متن کامل

Hedonic Games with Graph-restricted Communication

We study hedonic coalition formation games in which cooperation among the players is restricted by a graph structure: a subset of players can form a coalition if and only if they are connected in the given graph. We investigate the complexity of finding stable outcomes in such games, for several notions of stability. In particular, we provide an efficient algorithm that finds an individually st...

متن کامل

ar X iv : 1 10 5 . 18 24 v 2 [ cs . G T ] 3 D ec 2 01 1 Individual - based stability in hedonic games depending on the best or worst players ∗

We consider hedonic coalition formation games in which each player has preferences over the other players and his preferences over coalition structures are based on the best player (B-/B-hedonic games) or the worst player (W /W-hedonic games) in his coalition. We show that for B-hedonic games, an individually stable partition is guaranteed to exist and can be computed efficiently. Similarly, th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000