Beauty and Distance in the Stable Marriage Problem

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.

8 pages, 3 figures, submitted to epl

Cited by in corpus (11)

• Matching games with partial information
• The Stable Marriage Problem: an Interdisciplinary Review from the Physicist's Perspective
• Social Integration in Two-Sided Matching Markets
• Random Stable Matchings
• Statistical Mechanics of Competitive Resource Allocation using Agent-based Models
• Statistical mechanics of bipartite $z$-matchings
• Stable Roommates Problem with Random Preferences
• Small random instances of the stable roommates problem
• Competition May Increase Social Happiness in Bipartite Matching Problem
• Pair Formation within Multi-Agent Populations
• Affinity driven social networks