Chrome Extension
WeChat Mini Program
Use on ChatGLM

Finding Maximum Weakly Stable Matchings for Hospitals/Residents with Ties Problem Via Heuristic Search.

ADVANCES IN ARTIFICIAL INTELLIGENCE, AI 2023, PT I(2024)

Vinh Univ

Cited 0|Views11
Abstract
The Hospitals/Residents with Ties Problem is a many-one stable matching problem, in which residents need to be assigned to hospitals to meet their constraints. In this paper, we propose a simple heuristic algorithm but solve this problem efficiently. Our algorithm starts from an empty matching and gradually builds up a maximum stable matching of residents to hospitals. At each iteration, we propose a heuristic function to choose the best hospital for an active resident to form a resident-hospital pair for the matching. If the chosen hospital overcomes its offered capacity, we propose another heuristic function to remove the worst resident among residents assigned to the hospital in the matching. Our algorithm returns a stable matching if it finds no active resident. Experimental results show that our algorithm is efficient in execution time and solution quality for solving the problem.
More
Translated text
Key words
Gale-Shapley algorithm,Hospitals/Residents with Ties,Heuristic algorithm,Weakly stable matching
求助PDF
上传PDF
Bibtex
AI Read Science
AI Summary
AI Summary is the key point extracted automatically understanding the full text of the paper, including the background, methods, results, conclusions, icons and other key content, so that you can get the outline of the paper at a glance.
Example
Background
Key content
Introduction
Methods
Results
Related work
Fund
Key content
  • Pretraining has recently greatly promoted the development of natural language processing (NLP)
  • We show that M6 outperforms the baselines in multimodal downstream tasks, and the large M6 with 10 parameters can reach a better performance
  • We propose a method called M6 that is able to process information of multiple modalities and perform both single-modal and cross-modal understanding and generation
  • The model is scaled to large model with 10 billion parameters with sophisticated deployment, and the 10 -parameter M6-large is the largest pretrained model in Chinese
  • Experimental results show that our proposed M6 outperforms the baseline in a number of downstream tasks concerning both single modality and multiple modalities We will continue the pretraining of extremely large models by increasing data to explore the limit of its performance
Upload PDF to Generate Summary
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Data Disclaimer
The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn
Chat Paper

要点】:本文提出一种高效的启发式算法,解决医院/住院医生配对问题,通过逐步构建最大弱稳定匹配,优化住院医生的医院分配。

方法】:研究采用了一种从空匹配开始,逐步构建最大稳定匹配的启发式算法。

实验】:实验结果显示,该算法在执行时间和解决方案质量上均表现出高效率,解决了医院/住院医生配对问题。