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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 28 (1999)
Issue (Month): 4 ()
|Note:||Received February 1997/Final version September 1998|
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00182/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
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: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.