The popular assignment problem: when cardinality is more important than popularity

Telikepalli Kavitha, Tamás Király, Jannik Matuschke +2

We consider a matching problem in a bipartite graph $G=(A\cup B,E)$ where nodes in $A$ are agents having preferences in partial order over their neighbors, while nodes in $B$ are o…