Multisided matching games with complementarities
The paper considers multisided matching games with transfereable utility using the approach of cooperative game theory. Stable matchings are shown to exist when characteristic functions are supermodular, i.e., agents' abilities to contribute to the value of a coalition are complementary across types. We analyze the structure of the core of supermodular matching games and suggest an algorithm for constructing its extreme payoff vectors.
Volume (Year): 28 (1999)
Issue (Month): 4 ()
|Note:||Received February 1997/Final version September 1998|
|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:28:y:1999:i:4:p:489-509. 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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.