Cargando…
Matching-Updating Mechanism: A Solution for the Stable Marriage Problem with Dynamic Preferences
We studied the stable marriage problem with dynamic preferences. The dynamic preference model allows the agent to change its preferences at any time, which may cause instability in a matching. However, preference changing in SMP instances does not necessarily break all pairs of an existing match. So...
Autores principales: | Alimudin, Akhmad, Ishida, Yoshiteru |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8871443/ https://www.ncbi.nlm.nih.gov/pubmed/35205557 http://dx.doi.org/10.3390/e24020263 |
Ejemplares similares
-
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
por: Cseh, Ágnes, et al.
Publicado: (2023) -
Stable Matching with Uncertain Linear Preferences
por: Aziz, Haris, et al.
Publicado: (2019) -
A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences
por: Cseh, Ágnes, et al.
Publicado: (2022) -
Help with Sex Problems in Marriage
por: Sandler, Bernard
Publicado: (1965) -
“Almost-stable” matchings in the Hospitals / Residents problem with Couples
por: Manlove, David F., et al.
Publicado: (2016)