Before revision:  We extend the PhD algorithm to this multi-sided setting to compute ]  a stable matching in polynomial time, and we discuss its extension to arbitrary quotas. Finally, we illustrate the challenges that arise when not all advisor-co-advisor pairs are compatible, and critically review the statements from 30, 29 .
After revision:  We extend the PhD algorithm to this multi-sided setting to compute ] a stable matching 30, 29 .