Non-uniformly Stable Common Independent Sets
Computer Science and Game Theory
2026-01-19 v1
Abstract
In this paper, we consider a matroid generalization of the stable matching problem. In particular, we consider the setting where preferences may contain ties. For this generalization, we propose a polynomial-time algorithm for the problem of checking the existence of a common independent set satisfying non-uniform stability, which is a common generalization of super-stability and strong stability.
Cite
@article{arxiv.2601.11153,
title = {Non-uniformly Stable Common Independent Sets},
author = {Naoyuki Kamiyama},
journal= {arXiv preprint arXiv:2601.11153},
year = {2026}
}