How to show that popular matching is a special case of prioritized popular matching when priority is given by a random generator.

23 Views Asked by At

For one-sided preference-based matching in a bipartite graph, we have popular matching and prioritized popular matching. One can show that popular matching is a special case of prioritized popular matching by restricting priority P=1 for each agent in prioritized matching. But what if a random number generator decides the priority of each agent? Then I can not use the above argument. How can I show that popular matching is a restricted case of this random prioritized matching?