可調整提議順序的Pareto穩定多對多雙邊匹配方法
首發時間:2023-10-26
摘要:雙邊匹配問題在經濟學、計算機科學和運籌學等領域都有廣泛的研究與應用。傳統的雙邊匹配方法采用延遲接受策略,如Gale-Shapley算法,但存在一方占優的問題。本文針對弱偏好且具有多個匹配容量的雙邊匹配問題進行研究,提出了一種多對多雙邊匹配方法。一方面,通過Pareto改進路徑與改進環路,避免了強制轉換弱偏好所帶來的效率損失,得到Pareto穩定匹配結果;另一方面,通過可調整的提議順序,避免了單邊占優的情況,增強了匹配的公平性和參與意愿。本文為解決弱偏好下多個匹配容量的雙邊匹配問題提供了一種有效的決策方法,具有一定的實際應用價值。
關鍵詞: 多對多雙邊匹配; Pareto穩定; 弱偏好; 提議順序
For information in English, please click here
Pareto-Stable Many-to-Many Bipartite Matching Method with Adjustable Proposal Orders
Abstract:The bipartite matching problem has extensive research and applications in fields such as economics, computer science, and operations research. Traditional bipartite matching methods employ a deferred acceptance strategy, such as the Gale-Shapley algorithm, but they suffer from the issue of one side being favored. This article focuses on the bipartite matching problem with weak preferences and multiple matching capacities, proposing a many-to-many bipartite matching method.On one hand, by utilizing Pareto improvement paths and cycles, it avoids the efficiency loss caused by forcing weak preferences into strong preferences, resulting in Pareto-stable matching outcomes. On the other hand, through adjustable proposal orders, it prevents one side from dominating, enhancing the fairness and participation willingness of the matching. This article provides an effective decision-making method for addressing the bipartite matching problem with weak preferences and multiple matching capacities, offering practical applications in real-world scenarios.
Keywords: many-to-many bilateral matching pareto stability weak preferences proposal order
引用
No.****
動態公開評議
共計0人參與
勘誤表
可調整提議順序的Pareto穩定多對多雙邊匹配方法
評論
全部評論