| Summary: | Two-sided matching problems are common and crucial parts of human activity; the psychological behavior of agents is an important factor that should not be ignored in such problems. However, existing academic research has not considered the psychological behavior of agents in two-sided matching models. Therefore, this study develops a method for determining the most satisfactory results for agents on both sides of a matching problem that considers agents’ regret aversion behavior as measured using linguistic preference information. Initially, the preference utility and regret values are computed based on regret theory; then, the perceived utility values of each agent are obtained. This two-sided matching model has been established to maximize matching satisfaction without waste using the minmax method. Finally, a practical example is discussed to demonstrate the feasibility and validity of the proposed method.
|
|---|
