Stability in coalition formation games
In the context of coalition formation games a player evaluates a partition on the basis of the set she belongs to. For this evaluation to be possible, players are supposed to have preferences over sets to which they could belong. In this paper, we suggest two extensions of preferences over individuals to preferences over sets. For the first one, derived from the most preferred member of a set, it is shown that a strict core partition always exists if the original preferences are strict and a simple algorithm for the computation of one strict core partition is derived. This algorithm turns out to be strategy proof. The second extension, based on the least preferred member of a set, produces solutions very similar to those for the stable roommates problem.
Volume (Year): 29 (2001)
Issue (Month): 4 ()
|Note:||Received August 1998/Final version June 20, 2000|
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/182/PS2|
When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:29:y:2001:i:4:p:487-494. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.