Maintaining Stability for a Matching Problem Under Dynamic Preference
This study investigates two-sided matching and considers dynamic preference. In a stable matching problem, dynamic preference is a situation that often happens in real-world situations where the agent cannot express their preference with certainty. This study proposes a new concept to find stable ma...
Main Authors: | Akhmad Alimudin, Yoshiteru Ishida, Koutarou Suzuki |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2023-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10040650/ |
Similar Items
-
Matching-Updating Mechanism: A Solution for the Stable Marriage Problem with Dynamic Preferences
by: Akhmad Alimudin, et al.
Published: (2022-02-01) -
An approximate search algorithm for the student-internship allocation problem
by: NGUYEN Quang Ninh, et al.
Published: (2022-09-01) -
Stability and Median Rationalizability for Aggregate Matchings
by: Federico Echenique, et al.
Published: (2021-04-01) -
Dynamic person-position matching decision method based on hesitant fuzzy number information
by: Qi Yue, et al.
Published: (2024-02-01) -
A Note on the Uniqueness of Stable Marriage Matching
by: Drgas-Burchardt Ewa
Published: (2013-03-01)