The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - March-April (2013 vol.28)
pp: 81-85
Paul Harrenstein , University of Oxford
David Manlove , University of Glasgow
Michael Wooldridge , University of Oxford
ABSTRACT
Here, the authors discuss matching problems and how the Gale-Shapley algorithm solves them, while also explaining some matching techniques.
INDEX TERMS
Game theory, Algorithm design and analysis, intelligent systems, matching problems, Gale-Shapley algorithm, matching techniques
CITATION
Paul Harrenstein, David Manlove, Michael Wooldridge, "The Joy of Matching", IEEE Intelligent Systems, vol.28, no. 2, pp. 81-85, March-April 2013, doi:10.1109/MIS.2013.49
REFERENCES
1. D. Gale and L. S. Shapley, “College Admissions and the Stability of Marriage,” The Am. Math. Monthly, vol. 69, no. 1, 1962, pp. 9–15.
2. D. Gusfield and R.W. Irving., The Stable Marriage Problem: Structure and Algorithms, MIT Press, 1989.
3. A.E. Roth and M.A.O. Sotomayor, Two-Sided Matching: A Study in Game Theoretic Modeling and Analysis, Cambridge Univ. Press, 1990.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool