Popular Matchings with Two-Sided Preferences and One-Sided Ties

  title={Popular Matchings with Two-Sided Preferences and One-Sided Ties},
  author={{\'A}gnes Cseh and Chien-Chung Huang and Telikepalli Kavitha},
  journal={SIAM J. Discrete Math.},
We are given a bipartite graph G = (A ∪ B,E) where each vertex has a preference list ranking its neighbors: in particular, every a ∈ A ranks its neighbors in a strict order of preference, whereas the preference lists of b ∈ B may contain ties. A matching M is popular if there is no matching M ′ such that the number of vertices that prefer M ′ to M exceeds… CONTINUE READING

2 Figures & Tables



Citations per Year

Citation Velocity: 7

Averaging 7 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.