Testing popularity in lin
Testing popularity in linear time via maximum matching
Testing popularity in linear time via maximum matching
arXiv:2312.01880v3 Announce Type: replace
Abstract: Popularity is an approach in mechanism design to find fair structures in a graph, based on the votes of the nodes. Popular matchings are the relaxation of stable matchings: given a graph G=(V,E) with strict preferences on the neighbors of the node…
