Beauty and distance in the stable marriage problem
AbstractThe 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 InfoIf 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.
Bibliographic InfoArticle provided by Elsevier in its journal Physica A: Statistical Mechanics and its Applications.
Volume (Year): 300 (2001)
Issue (Month): 1 ()
Contact details of provider:
Web page: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/
Game theory; Matching problem; Optimization;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- 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.
- repec:ebl:ecbull:v:3:y:2008:i:67:p:1-12 is not listed on IDEAS
If references are entirely missing, you can add them using this form.