Deferred Acceptance With Compensation Chains

I introduce a class of algorithms called deferred acceptance with compensation chains (DACC). DACC algorithms generalize the Gale-Shapley algorithm by allowing both sides of the market to make offers. The main result is a characterization of the set of stable matchings: a matching is stable if and only if it is the outcome of a DACC algorithm. The proof of convergence of DACC algorithms uses a novel technique based on a construction of a potential function.