Three-Sided Matchings and Separable Preferences
Contributions to game theory and management, Tome 1 (2007), pp. 277-285

Voir la notice de l'article provenant de la source Math-Net.Ru

In this paper we provide sufficient conditions for the existence stable matchings for three-sided systems.
@article{CGTM_2007_1_a16,
     author = {Somdeb Lahiri},
     title = {Three-Sided {Matchings} and {Separable} {Preferences}},
     journal = {Contributions to game theory and management},
     pages = {277--285},
     publisher = {mathdoc},
     volume = {1},
     year = {2007},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CGTM_2007_1_a16/}
}
TY  - JOUR
AU  - Somdeb Lahiri
TI  - Three-Sided Matchings and Separable Preferences
JO  - Contributions to game theory and management
PY  - 2007
SP  - 277
EP  - 285
VL  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CGTM_2007_1_a16/
LA  - en
ID  - CGTM_2007_1_a16
ER  - 
%0 Journal Article
%A Somdeb Lahiri
%T Three-Sided Matchings and Separable Preferences
%J Contributions to game theory and management
%D 2007
%P 277-285
%V 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CGTM_2007_1_a16/
%G en
%F CGTM_2007_1_a16
Somdeb Lahiri. Three-Sided Matchings and Separable Preferences. Contributions to game theory and management, Tome 1 (2007), pp. 277-285. http://geodesic.mathdoc.fr/item/CGTM_2007_1_a16/