We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected … maximum weight many-to-one matching satisfying two sets of constraints: vertices in A are incident to at most one matching … edge, while vertices in P are either unmatched or they are incident to a number of matching edges between their lower and …

it to the stable allocation problem.We present an augmenting path algorithm for computing a stable flow, the first … algorithm that achieves polynomial running time for this problem without using stable allocations as a black-box subroutine. We … this problem, we present an elegant graph transformation and based on this, we devise a simple and fast algorithm, which …

In a two-sided matching market when agents on both sides have preferences the stability of the solution is typically …

experiments that demonstrate the reliability and efficiency of the DC-EGM algorithm and the associated maximum likelihood …

college admissions problem NP-hard to solve. Currently, a heuristic based on the Gale-Shapley algorithm is being used in the …