TY  - JOUR
A1  - Caldarelli, Guido
A1  - Capocci, Andrea
N2  - 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.
IS  - 1-2
TI  - Beauty and distance in the stable marriage problem
VL  - 300
EP  - 331
SP  - 325
AV  - none
Y1  - 2001/10//
PB  - Elsevier
UR  - http://dx.doi.org/10.1016/S0378-4371(01)00327-2
KW  - Game theory; Matching problem; Optimization
SN  - 0378-4371
JF  - Physica A: Statistical Mechanics and its Applications
ID  - eprints1152
ER  -