Citation:
Lehmann, Aron Matskin, and Daniel. “General Matching: Lattice Structure Of The Set Of Agreements”. Discussion Papers 2009. Web.
Abstract:
The subset agreement problem generalizes all forms of two-sided matching. Two agents need to agree on some subset of a given