Finding optimal mentor-mentee matches: A case study in applied two-sided matching

Christian Haas, Margeret Hall, Sandra L. Vlasnik

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Two-Sided Matching is a well-established approach to find allocations and matchings based on the participants' preferences. While its most prominent applications are College Admissions and School Choice problems, this paper applies the concept to the matching of mentors to mentees in a higher education context. Both mentors and mentees have preferences with whom they ideally want to be matched, as well as who they want to avoid. As the general formulation for these types of preferences is NP-hard, several existing approximation algorithms and heuristics are compared with respect to their ability to find a matching with desirable properties. The results show that a combination of evolutionary heuristics and local search approaches works best in finding high-quality solutions, allowing us to find mentor-mentee pairs which are close to the respective ideal match.

Original languageEnglish (US)
Article numbere00634
JournalHeliyon
Volume4
Issue number6
DOIs
StatePublished - Jun 2018

Fingerprint

Mentor
Two-sided matching
Local search
College admissions
Heuristic search
Evolutionary
Approximation algorithms
Heuristics
NP-hard
School choice

Keywords

  • Applied mathematics
  • Information science

ASJC Scopus subject areas

  • General

Cite this

Finding optimal mentor-mentee matches : A case study in applied two-sided matching. / Haas, Christian; Hall, Margeret; Vlasnik, Sandra L.

In: Heliyon, Vol. 4, No. 6, e00634, 06.2018.

Research output: Contribution to journalArticle

@article{d66e16fa73184565b5bcdddd1d3dc9a8,
title = "Finding optimal mentor-mentee matches: A case study in applied two-sided matching",
abstract = "Two-Sided Matching is a well-established approach to find allocations and matchings based on the participants' preferences. While its most prominent applications are College Admissions and School Choice problems, this paper applies the concept to the matching of mentors to mentees in a higher education context. Both mentors and mentees have preferences with whom they ideally want to be matched, as well as who they want to avoid. As the general formulation for these types of preferences is NP-hard, several existing approximation algorithms and heuristics are compared with respect to their ability to find a matching with desirable properties. The results show that a combination of evolutionary heuristics and local search approaches works best in finding high-quality solutions, allowing us to find mentor-mentee pairs which are close to the respective ideal match.",
keywords = "Applied mathematics, Information science",
author = "Christian Haas and Margeret Hall and Vlasnik, {Sandra L.}",
year = "2018",
month = "6",
doi = "10.1016/j.heliyon.2018.e00634",
language = "English (US)",
volume = "4",
journal = "Heliyon",
issn = "2405-8440",
publisher = "Elsevier BV",
number = "6",

}

TY - JOUR

T1 - Finding optimal mentor-mentee matches

T2 - A case study in applied two-sided matching

AU - Haas, Christian

AU - Hall, Margeret

AU - Vlasnik, Sandra L.

PY - 2018/6

Y1 - 2018/6

N2 - Two-Sided Matching is a well-established approach to find allocations and matchings based on the participants' preferences. While its most prominent applications are College Admissions and School Choice problems, this paper applies the concept to the matching of mentors to mentees in a higher education context. Both mentors and mentees have preferences with whom they ideally want to be matched, as well as who they want to avoid. As the general formulation for these types of preferences is NP-hard, several existing approximation algorithms and heuristics are compared with respect to their ability to find a matching with desirable properties. The results show that a combination of evolutionary heuristics and local search approaches works best in finding high-quality solutions, allowing us to find mentor-mentee pairs which are close to the respective ideal match.

AB - Two-Sided Matching is a well-established approach to find allocations and matchings based on the participants' preferences. While its most prominent applications are College Admissions and School Choice problems, this paper applies the concept to the matching of mentors to mentees in a higher education context. Both mentors and mentees have preferences with whom they ideally want to be matched, as well as who they want to avoid. As the general formulation for these types of preferences is NP-hard, several existing approximation algorithms and heuristics are compared with respect to their ability to find a matching with desirable properties. The results show that a combination of evolutionary heuristics and local search approaches works best in finding high-quality solutions, allowing us to find mentor-mentee pairs which are close to the respective ideal match.

KW - Applied mathematics

KW - Information science

UR - http://www.scopus.com/inward/record.url?scp=85048705663&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85048705663&partnerID=8YFLogxK

U2 - 10.1016/j.heliyon.2018.e00634

DO - 10.1016/j.heliyon.2018.e00634

M3 - Article

C2 - 29942871

AN - SCOPUS:85048705663

VL - 4

JO - Heliyon

JF - Heliyon

SN - 2405-8440

IS - 6

M1 - e00634

ER -