Stable matchings in three-sided systems with cyclic preferences
type: Item
instance of: scholarly article
title: Stable matchings in three-sided systems with cyclic preferences
zbMATH Open document ID: 1090.90159
author: Endre Boros
author: Steven Jaslar
author: Daniel Krasner
author: Vladimir Gurvich
published in: Discrete Mathematics
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 2136215
zbMATH Keywords: Gale-Shapley theorem
zbMATH Keywords: Stable matching
zbMATH Keywords: Stable marriage
zbMATH Keywords: Cyclic preferences
Wikidata QID: Q59560599
MaRDI profile type: Publication
full work available at URL: j.disc.2004.08.012
OpenAlex ID: W1995859802
cites work: Nonexistence of stable threesome matchings
cites work: Perfect graphs are kernel solvable
cites work: Existence of stable matchings in some three-sided systems.
cites work: Machiavelli and the Gale-Shapley Algorithm
cites work: College Admissions and the Stability of Marriage
cites work: The list chromatic index of a bipartite multigraph
cites work: Q3995616
DBLP publication ID: journals/dm/BorosGJK04
DOI: 10.1016/J.DISC.2004.08.012
description: scientific article; zbMATH DE number 2136215