Beauty and Distance in the Stable Marriage Problem
G. Caldarelli, A. Capocci
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 generalization of this model, introduced in order to take into account the presence of correlations in the lists and the effects of distance when the player are supposed to be represented by a position in space.
Create a lesson
Related papers
Real-Space renormalization for the drawups and drawdowns of stochastic trajectories: universality classes for diffusion processes and random walks via the scale function
Cecile Monthus
Stochastic synthesis and degradation of arbitrary diffusive processes
Denis Boyer, Gabriel Mercado-Vásquez
Critical amplitudes of the Baxter-Wu model from MCPA and Wolff simulations: free-exponent and fixed-exponent fits
Vyacheslav Mozolenko, Ian Pile, Lev Shchur
Capillary Coarsening Drives Re-entrant Statistical Transitions in Early Coffee-Ring Growth
Arundas Chandradasan, Dileep Mampallil
Maximum entropy explanation for the ubiquity of power-law mechanical responses
Sverre Holm
Thermodynamic Bethe Ansatz for the Toda chain from inverse scattering transform
Alberto Brollo