Stable matching in a common generalization of the marriage and assignment models
Combinatorics
2007-05-23 v1
Abstract
In the theory of two-sided matching markets there are two well-known models: the marriage model (where no money is involved) and the assignment model (where payments are involved). Roth and Sotomayor (1990) asked for an explanation for the similarities in behavior between those two models. We address this question by introducing a common generalization that preserves the two important features: the existence of a stable outcome and the lattice property of the set of stable outcomes.
Keywords
Cite
@article{arxiv.math/9801096,
title = {Stable matching in a common generalization of the marriage and assignment models},
author = {Kimmo Eriksson and Johan Karlander},
journal= {arXiv preprint arXiv:math/9801096},
year = {2007}
}
Comments
21 pages