Two-sided popular matchings in bipartite graphs with forbidden/forced elements and weights

12 Mar 2018 Faenza Yuri Powers Vladlena Zhang Xingyu

Two-sided popular matchings in bipartite graphs are a well-known generalization of stable matchings in the marriage setting, and they are especially relevant when preference lists are incomplete. In this case, the cardinality of a stable matching can be as small as half the size of a maximum matching... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DISCRETE MATHEMATICS

Datasets


  Add Datasets introduced or used in this paper