Abstract

The problem of surgeon-patient matching in elective surgery is studied. Considering the surgery competence, surgery skills, and the surgery preference ordinals of surgeons and the pairwise comparison information of patients on surgeons, the definitions of surgeon-patient individual rational matching, surgeon-patient stable matching, surgeon-patient α-stable matching and surgeon-patient Pareto effective matching are given. Aiming to maximize the cardinality of matching and obtain a surgeon-patient matching that maintains α-stability and Pareto efficiency, the I-DA algorithm is developed, and we prove that the obtained matching scheme balances the conflict between the stability and cardinality of matching. Finally, an example verifies the feasibility and effectiveness of the proposed method.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call