2 citations · 3 across the 4 of their papers we have counts for
5 papers
Minimal Envy Matchings in the Hospitals/Residents Problem with Lower Quotas
Changyong Hu, Vijay K. Garg
In the Hospitals/Residents problem, every hospital has an upper quota that limits the number of residents assigned to it. While, in some applications, each hospital also has a lowe…
Characterization of Super-stable Matchings
Changyong Hu, Vijay K. Garg
An instance of the super-stable matching problem with incomplete lists and ties is an undirected bipartite graph , with an adjacency list being a linearly ordere…
Improved Paths to Stability for the Stable Marriage Problem
Vijay Kumar Garg, Changyong Hu
The stable marriage problem requires one to find a marriage with no blocking pair. Given a matching that is not stable, Roth and Vande Vate have shown that there exists a sequence…
NC Algorithms for Popular Matchings in One-Sided Preference Systems and Related Problems
Changyong Hu, Vijay K. Garg
The popular matching problem is of matching a set of applicants to a set of posts, where each applicant has a preference list, ranking a non-empty subset of posts in the order of p…
Lattice Agreement in Message Passing Systems
Xiong Zheng, Changyong Hu, Vijay K. Garg
This paper studies the lattice agreement problem and the generalized lattice agreement problem in distributed message passing systems. In the lattice agreement problem, given input…