São Paulo School of Advanced Science on algorithms, combinatorics and optimization...
Advanced search
Stable matching problems
Full text
| |
| Author(s): |
Maycon Sambinelli
Total Authors: 1
|
| Document type: | Master's Dissertation |
| Press: | Campinas, SP. |
| Institution: | Universidade Estadual de Campinas (UNICAMP). Instituto de Computação |
| Defense date: | 2014-05-27 |
| Examining board members: |
Orlando Lee;
Eduardo Candido Xavier;
Jair Donadelli Junior
|
| Advisor: | Orlando Lee |
| Abstract | |
Stable matching problems consist of dividing one or more groups of agents in pairs, where each agent has an ordered preference list, and one wish to find a matching between them which respects a stability criterion that is based on their preferences. These problems are important because they have many practical applications, such as association of medical residents to hospitals, resource allocation in wireless communication and kidney donation. Due to the importance of the topic, this dissertation presents a survey describing the most important problems along with its main results (AU) | |
| FAPESP's process: | 12/16625-7 - Stable Matchings Problems |
| Grantee: | Maycon Sambinelli |
| Support Opportunities: | Scholarships in Brazil - Master |