In a general model of trading networks with bilateral contracts, we propose a suitably adapted chain stability concept that plays the same role as pairwise stability in two-sided settings. We show that chain stability is equivalent to stability if all agents' preferences are jointly fully...

We introduce a matching model in which agents engage in joint ventures via multilateral contracts. This approach allows us to consider production complementarities previously outside the scope of matching theory. We show analogues of the first and second welfare theorems and, when agents'...

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...

We study the effect of different school choice mechanisms on schools' incentives for quality improvement. To do so, we introduce the following criterion: A mechanism respects improvements of school quality if each school becomes weakly better off whenever that school becomes more preferred by...

We use the supply chain matching framework to study the effects of firm exit. We show that the exit of an initial supplier or end consumer has monotonic effects on the welfare of initial suppliers and end consumers but may simultaneously have positive and negative effects on intermediaries....

In matching markets, the existence of stable matchings can only be guaranteed under substantive restrictions on preferences. We investigate how these results change in large markets, which we model with a continuum of agents of each type, following the work of Aumann (1964) on general...

We introduce a model in which firms trade goods via bilateral contracts which specify a buyer, a seller, and the terms of the exchange. This setting subsumes (many-to-many) matching with contracts, as well as supply chain matching. When firms' relationships do not exhibit a supply chain...

We consider the many-to-many two-sided matching problem under a stringent domain restriction on preferences called the max-min criterion. We show that, even under this restriction, there is no stable mechanism that is weakly Pareto efficient, strategy-proof, or monotonic (i.e. respects...