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...
Guardado en:
| Autor principal: | Cesco, Juan |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2016
|
| Materias: | |
| 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: |
Ejemplares similares
-
The core of hedonic partitioning games
por: Cesco, Juan
Publicado: (2011) -
Two-sided matching : a study in game-theoretic modeling and analysis /
por: Roth, Alvin E., 1951-
Publicado: (1992) -
The MANY facets of graph theory
Publicado: (1969) -
All or nothing: The problem of (in)authenticity in Rayuela
por: Ralón, Laureano
Publicado: (2015) -
Approximated Cycles in TU-Games
por: Cesco, Juan
Publicado: (2015)