Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015 (2015), Article ID 241379, 10 pages
http://dx.doi.org/10.1155/2015/241379
Research Article

A Two-Sided Matching Decision Model Based on Uncertain Preference Sequences

School of Management, Huazhong University of Science and Technology, Wuhan 430074, China

Received 28 February 2015; Revised 23 May 2015; Accepted 28 May 2015

Academic Editor: Kyandoghere Kyamakya

Copyright © 2015 Xiao Liu and Huimin Ma. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. Janssen and A. Verbraeck, “Comparing the strengths and weaknesses of Internet-based matching mechanisms for the transport market,” Transportation Research Part E: Logistics and Transportation Review, vol. 44, no. 3, pp. 475–490, 2008. View at Publisher · View at Google Scholar · View at Scopus
  2. M. Sorensen, “How smart is smart money? A two-sided matching model of venture capital,” Journal of Finance, vol. 62, no. 6, pp. 2725–2762, 2007. View at Publisher · View at Google Scholar · View at Scopus
  3. H.-T. Lin, “A job placement intervention using fuzzy approach for two-way choice,” Expert Systems with Applications, vol. 36, no. 2, pp. 2543–2553, 2009. View at Publisher · View at Google Scholar · View at Scopus
  4. D. K. Huang, H. N. Chiu, R. H. Yeh, and J. H. Chang, “A fuzzy multi-criteria decision making approach for solving a bi-objective personnel assignment problem,” Computers & Industrial Engineering, vol. 56, no. 1, pp. 1–10, 2009. View at Publisher · View at Google Scholar · View at Scopus
  5. C. Haas, S. O. Kimbrough, S. Caton, and C. Weinhardt, “Preference-based resource allocation: using heuristics to solve two-sided matching problems with indifferences,” in Economics of Grids, Clouds, Systems, and Services, vol. 8193 of Lecture Notes in Computer Science, pp. 149–160, Springer, Berlin, Germany, 2013. View at Publisher · View at Google Scholar
  6. A. Abdulkadiroğlu, P. A. Pathak, and A. E. Roth, “The New York city high school match,” American Economic Review, vol. 95, no. 2, pp. 364–367, 2005. View at Publisher · View at Google Scholar · View at Scopus
  7. D. Gale and L. S. Shapley, “College admissions and the stability of marriage,” The American Mathematical Monthly, vol. 69, no. 1, pp. 9–15, 1962. View at Publisher · View at Google Scholar · View at MathSciNet
  8. A. E. Roth, “Common and conflicting interests in two-sided matching markets,” European Economic Review, vol. 27, no. 1, pp. 75–96, 1985. View at Publisher · View at Google Scholar · View at Scopus
  9. J. Edmonds, “Maximum matching and a polyhedron with 0,1-vertices,” Journal of Research of the National Bureau of Standards, vol. 69, no. 1-2, pp. 125–130, 1965. View at Publisher · View at Google Scholar · View at MathSciNet
  10. H. W. Kuhn, “The Hungarian method for the assignment problem,” Naval Research Logistics Quarterly, vol. 2, pp. 83–97, 1955. View at Publisher · View at Google Scholar · View at MathSciNet
  11. J. Munkres, “Algorithms for the assignment and transportation problems,” Journal of the Society for Industrial and Applied Mathematics, vol. 5, no. 1, pp. 32–38, 1957. View at Google Scholar · View at MathSciNet
  12. A. E. Roth, “On the allocation of residents to rural hospitals: a general property of two-sided matching markets,” Econometrica, vol. 54, no. 2, pp. 425–427, 1986. View at Publisher · View at Google Scholar · View at MathSciNet
  13. V. Knoblauch, “Marriage matching and gender satisfaction,” Social Choice and Welfare, vol. 32, no. 1, pp. 15–27, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. D. G. McVitie and L. B. Wilson, “The stable marriage problem,” Communications of the Association for Computing Machinery, vol. 14, no. 7, pp. 486–490, 1971. View at Publisher · View at Google Scholar · View at MathSciNet
  15. C.-P. Teo, J. Sethuraman, and W.-P. Tan, “Gale-Shapley stable marriage problem revisited: strategic issues and applications,” Management Science, vol. 47, no. 9, pp. 1252–1267, 2001. View at Publisher · View at Google Scholar · View at Scopus
  16. C. van Raalte and H. Webers, “Spatial competition with intermediated matching,” Journal of Economic Behavior and Organization, vol. 34, no. 3, pp. 477–488, 1998. View at Publisher · View at Google Scholar · View at Scopus
  17. D. Sarne and S. Kraus, “Managing parallel inquiries in agents' two-sided search,” Artificial Intelligence, vol. 172, no. 4-5, pp. 541–569, 2008. View at Google Scholar
  18. I. Korkmaz, H. Gökçen, and T. Çetinyokuş, “An analytic hierarchy process and two-sided matching based decision support system for military personnel assignment,” Information Sciences, vol. 178, no. 14, pp. 2915–2927, 2008. View at Publisher · View at Google Scholar · View at Scopus
  19. K. Iwama, D. Manlove, S. Miyazaki, and Y. Morita, “Stable marriage with incomplete lists and ties,” in Automata, Languages and Programming, vol. 1644 of Lecture Notes in Computer Science, pp. 443–452, Springer, Berlin, Germany, 1999. View at Publisher · View at Google Scholar
  20. D. F. Manlove, R. W. Irving, K. Iwama, S. Miyazaki, and Y. Morita, “Hard variants of stable marriage,” Theoretical Computer Science, vol. 276, no. 1-2, pp. 261–279, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  21. M. Halldorsson, K. Iwama, S. Miyazaki, and Y. Morita, “Inapproximability results on stable marriage problems,” in LATIN 2002: Theoretical Informatics, vol. 2286 of Lecture Notes in Computer Science, pp. 554–568, Springer, Berlin, Germany, 2002. View at Publisher · View at Google Scholar
  22. M. Li, Z. Fan, and Y. Liu, “A method for two-sided matching based on preference ordinal information,” Operations Research and Management Science, vol. 21, no. 4, pp. 112–118, 2012 (Chinese). View at Google Scholar
  23. A. H. Land and A. G. Doig, “An automatic method of solving discrete programming problems,” Econometrica, vol. 28, no. 3, pp. 497–520, 1960. View at Publisher · View at Google Scholar · View at MathSciNet