Skip to main content
SpringerLink
Log in
Book cover

International Conference on Ubiquitous Information Management and Communication

IMCOM 2019: Proceedings of the 13th International Conference on Ubiquitous Information Management and Communication (IMCOM) 2019 pp 1100–1111Cite as

A Searching for Strongly Egalitarian and Sex-Equal Stable Matchings

  • Conference paper
  • First Online:

  • 1215 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 935))

Abstract

The stable marriage problem with ties (SMT) is a variant of the stable marriage problem in which people are permitted to express ties in their preference lists. In this paper, an algorithm based on bidirectional searching is presented for trying to find strongly egalitarian and sex-equal stable matchings. We indicate that the use of two simultaneous searches in the algorithm not only accelerate the finding of solutions but also is appropriate for the strong stability criterion of SMT. The algorithm is implemented and tested for large datasets. Experimental results show that our algorithm is significant.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Monthly 69(1), 9–15 (1962)

    Article  MathSciNet  Google Scholar 

  2. Gelain, M., Pini, M., Rossi, F., Venable, K., Walsh, T.: Local search approaches in stable matching problems. Algorithms 6(4), 591–617 (2013)

    Article  MathSciNet  Google Scholar 

  3. Gent, I.P., Prosser, P.: An empirical study of the stable marriage problem with ties and incomplete lists. In: Proceedings of European Conference on Artificial Intelligence, Lyon, France, pp. 141–145 (2002)

    Google Scholar 

  4. Gusfield, D.: Three fast algorithms for four problems in stable marriage. SIAM J. Comput. 16(1), 111–128 (1987)

    Article  MathSciNet  Google Scholar 

  5. Irving, R.W.: An efficient algorithm for the “stable roommates” problem. J. Algorithms 6, 577–595 (1985)

    Article  MathSciNet  Google Scholar 

  6. Irving, R.W.: Stable marriage and indifference. Discrete Appl. Math. 48, 261–272 (1994)

    Article  MathSciNet  Google Scholar 

  7. Irving, R.W., Leather, P., Gusfield, D.: An efficient algorithm for the “optimal” stable marriage. J. ACM 34(3), 532–543 (1987)

    Article  MathSciNet  Google Scholar 

  8. Iwama, K., Manlove, D., Miyazaki, S., Morita, Y.: Stable marriage with incomplete lists and ties. In: Proceedings of the 26th International Colloquium on Automata, Languages, and Programming, LNCS, vol. 1644, pp. 443–452. Springer (1999)

    Google Scholar 

  9. Iwama, K., Miyazaki, S., Yanagisawa, H.: Approximation algorithms for the sex-equal stable marriage problem. ACM Trans. Algorithms 7(2) (2010). Article no. 2

    Article  MathSciNet  Google Scholar 

  10. Manlove, D.: Stable marriage with ties and unacceptable partners. Technical report TR-1999-29, University of Glasgow (1999)

    Google Scholar 

  11. Manlove, D.F.: The structure of stable marriage with indifference. Discrete Appl. Math. 122, 167–181 (2002)

    Article  MathSciNet  Google Scholar 

  12. McVitie, D.G., Wilson, L.B.: The stable marriage problem. Commun. ACM 14(7), 486–490 (1971)

    Article  MathSciNet  Google Scholar 

  13. Munera, D., Diaz, D., Abreu, S., Rossi, F., Saraswat, V., Codognet, P.: Solving hard stable matching problems via local search and cooperative parallelization. In: Proceeding of 29th AAAI Conference on Artificial Intelligence, Austin, Texas, United States, pp. 1212–1218 (2015)

    Google Scholar 

  14. Nakamura, M., Onaga, K., Kyan, S., Silva, M.: Genetic algorithm for sex-fair stable marriage problem. In: Proceedings of IEEE International Symposium on Circuits and Systems, Seattle, WA, ISCAS 95, vol. 1, pp. 509–512 (1995)

    Google Scholar 

  15. Vien, N.A., Viet, N., Kim, H., Lee, S., Chung, T.: Ant colony based algorithm for stable marriage problem, vol. 1, pp. 457–461. Springer, Dordrecht (2007)

    Google Scholar 

  16. Viet, H.H., Trang, L.H., Lee, S., Chung, T.: A bidirectional local search for the stable marriage problem. In: Proceedings of the 2016 International Conference on Advanced Computing and Applications, Can Tho City, Vietnam, pp. 18–24 (2016)

    Google Scholar 

  17. Viet, H.H., Trang, L.H., Lee, S., Chung, T.: An empirical local search for the stable marriage problem. In: Proceedings of the 14th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence, Phuket, Thailand, pp. 556–564 (2016)

    Google Scholar 

Download references

Acknowledgement

This research is funded by the Vietnam National Foundation for Science and Technology Development (NAFOSTED) under grant number 102.01-2017.09.

Author information

Authors and Affiliations

  1. Ho Chi Minh City University of Technology, VNU-HCM, 268 Ly Thuong Kiet, Ho Chi Minh City, Vietnam

    Le Hong Trang & Tran Van Hoai

  2. Vinh University, 182 Le Duan, Vinh City, Nghe An Province, Vietnam

    Hoang Huu Viet & Tran Xuan Hao

Authors
  1. Le Hong Trang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hoang Huu Viet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tran Van Hoai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tran Xuan Hao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Le Hong Trang .

Editor information

Editors and Affiliations

  1. Intelligent Systems Research Institute, Sungkyunkwan University, Suwon, Korea (Republic of)

    Sukhan Lee

  2. Software Engineering, Universiti Kuala Lumpur, Kuala Lumpur, Malaysia

    Roslan Ismail

  3. College of Software, Sungkyunkwan University, Suwon, Korea (Republic of)

    Hyunseung Choo

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Trang, L.H., Viet, H.H., Van Hoai, T., Hao, T.X. (2019). A Searching for Strongly Egalitarian and Sex-Equal Stable Matchings. In: Lee, S., Ismail, R., Choo, H. (eds) Proceedings of the 13th International Conference on Ubiquitous Information Management and Communication (IMCOM) 2019. IMCOM 2019. Advances in Intelligent Systems and Computing, vol 935. Springer, Cham. https://doi.org/10.1007/978-3-030-19063-7_87

Download citation

Publish with us

Policies and ethics

Search

Navigation