Popular b-matchings
Data Structures and Algorithms
2011-01-04 v1
Abstract
Suppose that each member of a set of agents has a preference list of a subset of houses, possibly involving ties and each agent and house has their capacity denoting the maximum number of correspondingly agents/houses that can be matched to him/her/it. We want to find a matching , for which there is no other matching such that more agents prefer to than to . (What it means that an agent prefers one matching to the other is explained in the paper.) Popular matchings have been studied quite extensively, especially in the one-to-one setting. We provide a characterization of popular b-matchings for two defintions of popularity, show some -hardness results and for certain versions describe polynomial algorithms.
Keywords
Cite
@article{arxiv.1101.0021,
title = {Popular b-matchings},
author = {Katarzyna Paluch},
journal= {arXiv preprint arXiv:1101.0021},
year = {2011}
}