Advanced Search
MyIDEAS: Login

Farsightedly Stable Matchings

Contents:

Author Info

  • N. Roketskiy

    ()
    (Department of Economics, UCL)

Registered author(s):

    Abstract

    We study the properties of von Neumann-Morgenstern farsightedly stable sets in application to matching models. We show that the result by Diamantoudi and Xue (2003) for hedonic games can be extended to a general matching with contracts framework: a collection of singleton stable sets constitutes a weak core of the matching with contracts game. We also show that singleton stable sets are invariant under different contractual languages.

    Download Info

    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.
    File URL: http://www.NETinst.org/Roketskiy_12-26.pdf
    Download Restriction: no

    Bibliographic Info

    Paper provided by NET Institute in its series Working Papers with number 12-26.

    as in new window
    Length: 15 pages
    Date of creation: Oct 2012
    Date of revision:
    Handle: RePEc:net:wpaper:1226

    Contact details of provider:
    Web page: http://www.NETinst.org/

    Related research

    Keywords: farsighted stable sets;

    Find related papers by JEL classification:

    This paper has been announced in the following NEP Reports:

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Bettina Klaus & Flip Klijn & Markus Walzl, 2011. "Farsighted Stability for Roommate Markets," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 13(6), pages 921-933, December.
    2. Effrosyni Diamantoudi & Licun Xue, 2003. "Farsighted stability in hedonic games," Social Choice and Welfare, Springer, vol. 21(1), pages 39-61, 08.
    3. Kominers, Scott Duke, 2012. "On the correspondence of contracts to salaries in (many-to-many) matching," Games and Economic Behavior, Elsevier, vol. 75(2), pages 984-989.
    4. John William Hatfield & Scott Duke Kominers & Alexandru Nichifor & Michael Ostrovsky & Alexander Westkamp, 2013. "Stability and Competitive Equilibrium in Trading Networks," Journal of Political Economy, University of Chicago Press, vol. 121(5), pages 966 - 1005.
    5. Michael Ostrovsky, 2008. "Stability in Supply Chain Networks," American Economic Review, American Economic Association, vol. 98(3), pages 897-923, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:net:wpaper:1226. 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: (Nicholas Economides).

    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.