International Journal of Biomedical Engineering and Clinical Science
Volume 4, Issue 2, June 2018, Pages: 36-47
Received: Mar. 7, 2018;
Accepted: Mar. 27, 2018;
Published: Apr. 18, 2018
Views 1421 Downloads 60
Min Zhou, School of Business Administration, Hunan University of Commerce, Changsha, China; School of Economics and Management, Southeast University, Nanjing, China
Lindu Zhao, School of Economics and Management, Southeast University, Nanjing, China
Shujuan Qu, The Third Xiangya Hospital of Central South University, Changsha, China
Kathryn Sarah Campy, Center for Public Health Initiatives, University of Pennsylvania, Philadelphia, USA
In China, 10% of medical resource are general hospital which treat 86% patients. This will lead the health resources in these hospitals become insufficient and exhaust, even if the resources in other hospitals idle. Previous studies have indicated that the scattering resource systems will result in significant imbalances if it lacks stable and effective match. To deal with Two-Sided Matching (TSM) problem in hierarchical medical system, a matching decision-making approach based on multiple scenarios was proposed. The algorithm was designed to adapt four kinds of scenarios, it analyzed multi-context matching satisfaction degree of these cooperation situations in different forms of environment respectively and specifically．By comparing the examples, the multi - scenario dynamic matching method is superior to the random matching algorithm and the “F-Y” algorithm (improved G - S algorithm), and it is effective to obtain the stable and feasible solution. This paper showed a multi-scenarios dynamic matching algorithm for hierarchical treatment system by modifying comprehensive satisfaction integration function and differential adjustment function. This paper concentrated on the stability and total satisfaction goals of system matching. This method serves as a decision-making reference for the bilateral matching encountered in the problem of “hierarchical treatment system” around the world.
Kathryn Sarah Campy,
Multi-Scenarios Dynamic Matching Algorithm for Hierarchical Treatment System, International Journal of Biomedical Engineering and Clinical Science.
Vol. 4, No. 2,
2018, pp. 36-47.
Dietl, H., M. Lang, and P. L. Lin, Advertising pricing models in media markets: Lump-sum versus per-consumer charges. Information Economics and Policy, 2013. 25 (4): p. 257-271.
Fleiner, T., R. W. Irving, and D. F. Manlove, An algorithm for a super-stable roommates problem. Theoretical Computer Science, 2011. 412 (50): p. 7059-7065.
Gale, D. and L. S. Shapley, College Admissions and the Stability of Marriage. American Mathematical Monthly, 2013. 120 (5): p. 386-391.
Ingolfsson, A., et al., Combining integer programming and the randomization method to schedule employees. European Journal of Operational Research, 2010. 202 (1): p. 153-163.
Rochet, J. C. and J. Tirole, Tying in two-sided markets and the honor all cards rule. International Journal of Industrial Organization, 2008. 26 (6): p. 1333-1347.
Boudreau, J. W. and V. Knoblauch, What price stability? Social welfare in matching markets. Mathematical Social Sciences, 2014. 67: p. 27-33.
Feldman, Z., et al., Staffing of time-varying queues to achieve time-stable performance. Management Science, 2008. 54 (2): p. V-V.
Sulzle, K., Duopolistic competition between independent and collaborative business-to-business marketplaces. International Journal of Industrial Organization, 2009. 27 (5): p. 615-624.
Coles, P. and R. Shorrer, Optimal truncation in matching markets. Games and Economic Behavior, 2014. 87: p. 591-615.
Fletcher, A., et al., The DH Accident and Emergency Department model: a national generic model used locally. Journal of the Operational Research Society, 2007. 58 (12): p. 1554-1562.
Drgas-Burchardt, E. and Z. Switalski, A number of stable matchings in models of the Gale-Shapley type. Discrete Applied Mathematics, 2013. 161 (18): p. 2932-2936.
Ashlagi, I., et al., Nonsimultaneous Chains and Dominos in Kidney- Paired Donation-Revisited. American Journal of Transplantation, 2011. 11 (5): p. 984-994.
Sarne, D. and S. Kraus, Managing parallel inquiries in agents' two-sided search. Artificial Intelligence, 2008. 172 (4-5): p. 541-569.
Munro, J., S. Mason, and J. Nicholl, Effectiveness of measures to reduce emergency department waiting times: a natural experiment. Emergency Medicine Journal, 2006. 23 (1): p. 35-39.
Roth, A. E., COMMON AND CONFLICTING INTERESTS IN 2-SIDED MATCHING MARKETS. European Economic Review, 1985. 27 (1): p. 75-96.
Roth, A. E., T. Sonmez, and M. U. Unver, Kidney paired donation with compatible pairs. American Journal of Transplantation, 2008. 8 (2): p. 463-463.
Roth, A. E., et al., Utilizing list exchange and nondirected donation through 'Chain' paired kidney donations. American Journal of Transplantation, 2006. 6 (11): p. 2694-2705.
Vasconcelos, H., Is exclusionary pricing anticompetitive in two-sided markets? International Journal of Industrial Organization, 2015. 40: p. 1-10.
Chakraborty, A., A. Citanna, and M. Ostrovsky, Two-sided matching with interdependent values. Journal of Economic Theory, 2010. 145 (1): p. 85-105.
Ashlagi, I. and F. Klijn, Manipulability in matching markets: conflict and coincidence of interests. Social Choice and Welfare, 2012. 39 (1): p. 23-33.
Izady, N. and D. Worthington, Setting staffing requirements for time dependent queueing networks: The case of accident and emergency departments. European Journal of Operational Research, 2012. 219 (3): p. 531-540.
Leider, S. and A. E. Roth, Kidneys for Sale: Who Disapproves, and Why? American Journal of Transplantation, 2010. 10 (5): p. 1221-1227.
Klumpp, T., Two-sided matching with spatially differentiated agents. Journal of Mathematical Economics, 2009. 45 (5-6): p. 376-390.
Ronn, E., NP-COMPLETE STABLE MATCHING PROBLEMS. Journal of Algorithms, 1990. 11 (2): p. 285-304.
Rees, M. A., et al., Global kidney exchange: Financially incompatible pairs are not transplantable compatible pairs. American Journal of Transplantation, 2017. 17 (10): p. 2743-2744.