On diversifying stable assignments
Combinatorics
2023-08-29 v2
Abstract
We consider the stable assignment problem on a graph with nonnegative real capacities on the edges and quotas on the vertices, in which the preferences of agents are given via diversifying choice functions. We prove that for any input of the problem, there exists exactly one stable assignment, and propose a polynomial time algorithm to find it.
Cite
@article{arxiv.2308.09797,
title = {On diversifying stable assignments},
author = {Alexander V. Karzanov},
journal= {arXiv preprint arXiv:2308.09797},
year = {2023}
}
Comments
10 pages, 1 figure. At the end of updated version, a generalization to hypergraphs is briefly discussed