Advanced Search
MyIDEAS: Login

Beauty and distance in the stable marriage problem

Contents:

Author Info

  • Caldarelli, G.
  • Capocci, A.
Registered author(s):

    Abstract

    The stable marriage problem has been introduced in order to describe a complex system where individuals attempt to optimise their own satisfaction, subject to mutually conflicting constraints. Due to the potential large applicability of such model to describe all the situation where different objects has to be matched pairwise, the statistical properties of this model have been extensively studied. In this paper, we present a generalisation of this model, introduced in order to take into account the presence of correlations in the lists and the effects of distance when the players are supposed to be represented by a position in space.

    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.sciencedirect.com/science/article/pii/S0378437101003272
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    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.

    Bibliographic Info

    Article provided by Elsevier in its journal Physica A: Statistical Mechanics and its Applications.

    Volume (Year): 300 (2001)
    Issue (Month): 1 ()
    Pages: 325-331

    as in new window
    Handle: RePEc:eee:phsmap:v:300:y:2001:i:1:p:325-331

    Contact details of provider:
    Web page: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/

    Related research

    Keywords: Game theory; Matching problem; Optimization;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. E. M. Parilina & A. Tampieri, 2013. "Marriage Formation with Assortative Meeting as a Two-Sided Optimal Stopping Problem," Working Papers wp886, Dipartimento Scienze Economiche, Universita' di Bologna.
    2. Janine Balter & Michela Rancan & Olena Senyuta, 2014. "Truncation in the Matching Markets and Market Ineffciency," RSCAS Working Papers 2014/04, European University Institute.
    3. repec:ebl:ecbull:v:3:y:2008:i:67:p:1-12 is not listed on IDEAS

    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:eee:phsmap:v:300:y:2001:i:1:p:325-331. 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: (Zhang, Lei).

    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.