7 citations · 14 across the 8 of their papers we have counts for
1 paper · 1 filter
Rupam Acharyya, Sourav Chakraborty, Nitesh Jha
We study the problem of counting the number of popular matchings in a given instance. A popular matching instance consists of agents A and houses H, where each agent ranks a subset…