Advanced search
Start date
Betweenand

Stable Matchings Problems

Grant number: 12/16625-7
Support Opportunities:Scholarships in Brazil - Master
Start date: November 01, 2012
End date: February 28, 2014
Field of knowledge:Physical Sciences and Mathematics - Computer Science - Theory of Computation
Principal Investigator:Orlando Lee
Grantee:Maycon Sambinelli
Host Institution: Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil

Abstract

A stable matching problem consists in dividing a group of agents into pairs, whereeach agent own a ordered preference list, and we want to find a combination thatrespects a criterion of stability. These problems are important because theyhave many practical applications, such as association of residents to hospitals,resource allocation in wireless communication and kidney donation. Due to theimportance of the topic, we propose a study of this class of problems, focusingon the classification of the problems of a computational point of view.

News published in Agência FAPESP Newsletter about the scholarship:
More itemsLess items
Articles published in other media outlets ( ):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

Academic Publications
(References retrieved automatically from State of São Paulo Research Institutions)
SAMBINELLI, Maycon. Stable matching problems. 2014. Master's Dissertation - Universidade Estadual de Campinas (UNICAMP). Instituto de Computação Campinas, SP.