Matching System for Animal-Assisted Therapy Based on the Levenshtein and Gale-Shapley Algorithms

Giuliana Gutiérrez-Rondón, Juan Gutiérrez-Cárdenas

Research output: Chapter in Book/Report/Conference proceedingPaper (Conference contribution)peer-review


This current research is based on the implementation of an algorithm that assigns pets, cats, or dogs to persons with depressive disorders such as low self-esteem. We found that even though different institutions have made the assignments of pets to patients, we were not able to find one that uses an IT tool for this task. Because of this situation, we decided to adapt to the well-known Gale-Shapley algorithm that has been used successfully in different situations in which it needs a perfect match between two parties. The results obtained have been validated by experts in the field of animal and person psychology. Because the Gale-Shapley algorithm needs a preference array between the parts involved and due that an animal cannot establish this set of preferences, we aimed to use a string similarity-based algorithm for obtaining preferences arrays based on the behavioral traits of an animal or person.

Original languageEnglish
Title of host publicationProceedings of the Future Technologies Conference, FTC 2020, Volume 3
EditorsKohei Arai, Supriya Kapoor, Rahul Bhatia
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages19
ISBN (Print)9783030630911
StatePublished - 2021
EventFuture Technologies Conference, FTC 2020 - San Francisco, United States
Duration: 5 Nov 20206 Nov 2020

Publication series

NameAdvances in Intelligent Systems and Computing
ISSN (Print)2194-5357
ISSN (Electronic)2194-5365


ConferenceFuture Technologies Conference, FTC 2020
CountryUnited States
CitySan Francisco


  • Animals assisted therapy
  • Stable matching
  • String similarity

Fingerprint Dive into the research topics of 'Matching System for Animal-Assisted Therapy Based on the Levenshtein and Gale-Shapley Algorithms'. Together they form a unique fingerprint.

Cite this