[HTML][HTML] The stable marriage problem: An interdisciplinary review from the physicist's perspective

EM Fenoaltea, IB Baybusinov, J Zhao, L Zhou… - Physics Reports, 2021 - Elsevier
We present a fascinating model that has lately caught attention among physicists working in
complexity related fields. Though it originated from mathematics and later from economics …

Algorithms for trip-vehicle assignment in ride-sharing

X Bei, S Zhang - Proceedings of the AAAI Conference on Artificial …, 2018 - ojs.aaai.org
We investigate the ride-sharing assignment problem from an algorithmic resource allocation
point of view. Given a number of requests with source and destination locations, and a …

A survey of the stable marriage problem and its variants

K Iwama, S Miyazaki - International conference on informatics …, 2008 - ieeexplore.ieee.org
The stable marriage problem is to find a matching between men and women, considering
preference lists in which each person expresses his/her preference over the members of the …

Three-sided stable matchings with cyclic preferences

P Biró, E McDermid - Algorithmica, 2010 - Springer
Abstract Knuth (Mariages Stables, Les Presses de L'Université de Montréal, 1976) asked
whether the stable matching problem can be generalised to three dimensions, eg, for …

Three-dimensional stable matching with cyclic preferences

K Eriksson, J Sjöstrand, P Strimling - Mathematical Social Sciences, 2006 - Elsevier
We consider stable three-dimensional matchings of three genders (3GSM). Alkan [Alkan, A.,
1988. Non-existence of stable threesome matchings. Mathematical Social Sciences 16, 207 …

Core stability in hedonic coalition formation

GJ Woeginger - SOFSEM 2013: Theory and Practice of Computer …, 2013 - Springer
In many economic, social and political situations individuals carry out activities in groups
(coalitions) rather than alone and on their own. Examples range from households and sport …

Joint power allocation and user scheduling for device-to-device-enabled heterogeneous networks with non-orthogonal multiple access

J Liu, G Wu, S Xiao, X Zhou, GY Li, S Guo, S Li - IEEE Access, 2019 - ieeexplore.ieee.org
Device-to-device (D2D) communications-enabled dense heterogeneous networks (HetNets)
with non-orthogonal multiple access (NOMA) are promising solutions to meet the high …

Geometric stable roommates

EM Arkin, SW Bae, A Efrat, K Okamoto… - Information Processing …, 2009 - Elsevier
We consider instances of the Stable Roommates problem that arise from geometric
representation of participants' preferences: a participant is a point in a metric space, and his …

Three-dimensional stable matching problem for spatial crowdsourcing platforms

B Li, Y Cheng, Y Yuan, G Wang, L Chen - Proceedings of the 25th ACM …, 2019 - dl.acm.org
The popularity of mobile Internet techniques and Online-To-Offline (O2O) business models
has led to the emergence of various spatial crowdsourcing (SC) platforms in our daily life. A …

Two's company, three'sa crowd: Stable family and threesome roommates problems

CC Huang - Algorithms–ESA 2007: 15th Annual European …, 2007 - Springer
We investigate Knuth's eleventh open question on stable matchings. In the stable family
problem, sets of women, men, and dogs are given, all of whom state their preferences …