Citation:
Lehmann, A. M., & Daniel, . (2009). General Matching: Lattice Structure of the Set of Agreements. Discussion Papers. presented at the 1. Retrieved from /files/dp501.pdf
Abstract:
The subset agreement problem generalizes all forms of two-sided matching. Two agents need to agree on some subset of a given