2 papers
cs.DM2018
Popular Matchings and Limits to Tractability
Yuri Faenza, Telikepalli Kavitha, Vladlena Powers +1
We consider popular matching problems in both bipartite and non-bipartite graphs with strict preference lists. It is known that every stable matching is a min-size popular matching…
cs.DM2018
Two-sided popular matchings in bipartite graphs with forbidden/forced elements and weights
Yuri Faenza, Vladlena Powers, Xingyu Zhang
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…