We provide an algorithm for testing the substitutability of a length-N preference relation over a set of contracts X in time O(|X|3⋅N3). Access to the preference relation is essential for this result: We show that a substitutability-testing algorithm with access only to an agentʼs choice...

Hatfield and Milgrom [Hatfield, John William, Milgrom, Paul R., 2005. Matching with contracts. Amer. Econ. Rev. 95, 913-935] present a unified model of matching with contracts, which includes the standard two-sided matching and some package auction models as special cases. They show that the...

In this note, we demonstrate that the problem of "many-to-one matching with (strict) preferences over colleagues" is actually more difficult than the classical many-to-one matching problem, "matching without preferences over colleagues." We give an explicit reduction of any problem of the latter...

In this note, I extend the work of Echenique (2012) to show that a model of many-to-many matching with contracts may be embedded into a model of many-to-many matching with wage bargaining whenever (1) all agentsʼ preferences are substitutable and (2) the matching with contracts model is...