Browse > Article
http://dx.doi.org/10.3745/KIPSTB.2011.18B.3.165

Solving the Gale-Shapley Problem by Ant-Q learning  

Kim, Hyun (경희대학교 컴퓨터공학과)
Chung, Tae-Choong (경희대학교 컴퓨터공학과)
Publication Information
The KIPS Transactions:PartB / v.18B, no.3, 2011 , pp. 165-172 More about this Journal
Abstract
In this paper, we propose Ant-Q learning Algorithm[1], which uses the habits of biological ants, to find a new way to solve Stable Marriage Problem(SMP)[3] presented by Gale-Shapley[2]. The issue of SMP is to find optimum matching for a stable marriage based on their preference lists (PL). The problem of Gale-Shapley algorithm is to get a stable matching for only male (or female). We propose other way to satisfy various requirements for SMP. ACS(Ant colony system) is an swarm intelligence method to find optimal solution by using phermone of ants. We try to improve ACS technique by adding Q learning[9] concept. This Ant-Q method can solve SMP problem for various requirements. The experiment results shows the proposed method is good for the problem.
Keywords
Stable Marriage Problem; Ant Colony System; Q-learning; Ant-Q; TSP;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 R.W. Irving, D.F. Manlove and S. Scott, "The Hospitals/Residents Problem with Ties", in Proceedings of SWAT 2000, the 7th Scandinavian Workshop on Algorithm Theory, volume 1851 of Lecture Notes in Computer Science (Springer-Verlag, 2000), pp.259-271.
2 A. Colorni, M. Dorigo, and V. Maniezzo, "An Investigation of Some Properties of An Ant Algorithm." Proceedings of the Parallel Problem Solving from Nature Conference (PPSN 92), R. Mäanner and B. Manderick(Eds.), Elsevier Publishing, pp.509-520. 1992,
3 Caironi P.V.C. & M. Dorigo "Training and Delayed Reinforcements in Q-learning Agents" International Journal of Intelligent Systems, in press. (Also available as Tech. Rep. IRIDIA/94-14, Universite Libre de Bruxelles, Belgium.), 1997.
4 Li Li, F. Qiao, Q. D. Wu,"ACO-based multi-objective scheduling of parallel batch processing machines with advanced process control constraints",The International Journal of Advanced Manufacturing Technology Vol.44, Numbers 9-10 985-994 1433-3015, Springer-Verlag, 2009.   DOI
5 B. Hoolldobler and E.O. Wilson, "The ants". Springer-Verlag, Berlin, 1990.
6 김현,정태충,"ACS 알고리즘을 이용한 안정된 결혼 문제 해결에 관한 연구", 전자공학회 논문지 제 47편 CI편 제 6호 pp.68-74, 2010. 11.
7 M Dorigo, and L. Ganbardella. Ant Colony System: A Cooperative Learning Approach To The Traveling Salesman Problem, IEEE transactions on Evolutionary Computing, 1(1):53-66, 1997.   DOI
8 M. Dorigo, V. Maniezzo, and A.Colorni. The Ant System: Optimization by A Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, Vol.26, No.2, pp.29-41, 1996.   DOI
9 D.Gale and L.S.Shapley, "College admissions and the stability of marriage," American Mat hematical Monthly, Vol.69, pp.9-15, 1962.   DOI   ScienceOn
10 Dorigo M. and L.M. Gambardella, "Ant-Q: A Reinforcement Learning Approach to Combinatorial Optimization" Tech. Rep. IRIDIA/95-01, Universite Librede Bruxelles, Belgium. 1995.
11 D.Gusfield and R.W.Irving, The Stable Marriage Problem: Structure and Algorithms, The MIT Press, 1989.
12 An efficient algorithm for the "stable roommates" problem", Journal of Algorithms 6 (4): 577-595. Irving, Robert W, 1985.   DOI
13 Marilda Sotomayor, "The stability of the equilibrium outcomes in the admission games induced by stable matching rules",International Journal of Game Theory Vol.36, Numbers 3-4 621-640 0020-7276, Springer-Verlag, 2008   DOI
14 Robert W. Irving "Stable matching problems with exchange restrictions", Journal of combinatorial optimization Volume 16, Number 4 344-360 1382-6905, 2008   DOI
15 Bettina Klaus, Flip Klijn, Jordi Masso "Some things couples always wanted to know about stable matchings (but were afraid to ask)" Review of Economic Design Vol.11, Number 3 175-184 1434-4742, 2006