Balanced many-to-one matching problems with preferences over colleagues

Matching problems is a well studied class of coalitions formation models. Several core-like type solutions have been proposed for these models. However, unlike what happens in game theory, no balancedness properties have been introduced to study existence problems so far. In this paper we state a ba...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Cesco, Juan
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2016
Materias:
Ciencias Informáticas
teoría de grafos
theory of hedonic games
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/58572
http://45jaiio.sadio.org.ar/sites/default/files/Sio-21.pdf
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-58572
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
teoría de grafos
theory of hedonic games
spellingShingle Ciencias Informáticas
teoría de grafos
theory of hedonic games
Cesco, Juan
Balanced many-to-one matching problems with preferences over colleagues
topic_facet Ciencias Informáticas
teoría de grafos
theory of hedonic games
description Matching problems is a well studied class of coalitions formation models. Several core-like type solutions have been proposed for these models. However, unlike what happens in game theory, no balancedness properties have been introduced to study existence problems so far. In this paper we state a balancedness condition on a many-to-one matching problem with preferences over colleagues which turns to be a necessary and sufficient condition to guarantee the non-emptiness of the set of core matchings. We use this result to improve a recent characterization about the existence of core matchings for the classical many-to-one matching problem without preferences over colleagues. Our approach has been carried out by using some techniques and results from the theory of hedonic games, which is another class of coalitions formation models.
format Objeto de conferencia
Objeto de conferencia
author Cesco, Juan
author_facet Cesco, Juan
author_sort Cesco, Juan
title Balanced many-to-one matching problems with preferences over colleagues
title_short Balanced many-to-one matching problems with preferences over colleagues
title_full Balanced many-to-one matching problems with preferences over colleagues
title_fullStr Balanced many-to-one matching problems with preferences over colleagues
title_full_unstemmed Balanced many-to-one matching problems with preferences over colleagues
title_sort balanced many-to-one matching problems with preferences over colleagues
publishDate 2016
url http://sedici.unlp.edu.ar/handle/10915/58572
http://45jaiio.sadio.org.ar/sites/default/files/Sio-21.pdf
work_keys_str_mv AT cescojuan balancedmanytoonematchingproblemswithpreferencesovercolleagues
bdutipo_str Repositorios
_version_ 1764820478021599232

Ejemplares similares