17 citations · 47 across the 21 of their papers we have counts for
1 paper · 1 filter
Elad Aigner-Horev, Erel Segal-Halevi
A matching in a bipartite graph with parts X and Y is called envy-free if no unmatched vertex in X is a adjacent to a matched vertex in Y. Every perfect matching is envy-free, but…