Phd Canditate :

E-mail :

Supervisor :

Dr. Pavlos Eirnakis


Professor P. Miliotis

PhD Thesis Abstract

The main aim of this Ph.D. thesis is to broaden understanding on the structures that describe or underlie stable matching problems and on the way these structures interrelate and can be employed to provide efficient ways to solve related problems. In that regard, several interesting variations of the stable matching problem are examined. More specifically, (Eirinakis, 2010) examines the Stable Matching, the Stable Admissions, the many-to-many Stable Matching, and the Chain Stable Network problem. Moreover, the corresponding study uses various different graphical and mathematical representations of these problems, while several different approaches are utilized.