Various forms of substitutability are essential for establishing the existence of equilibria and other useful properties in diverse settings such as matching, auctions, and exchange economies with indivisible goods. We extend earlier models' definitions of substitutability to settings in which...

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

Various forms of substitutability are essential for establishing the existence of equilibria and other useful properties in diverse settings such as matching, auctions, and exchange economies with indivisible goods. We extend earlier models' definitions of substitutability to settings in which...

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

In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even...

We study a double auction environment where buyers and sellers have interdependent valuations and multi-unit demand and supply. We propose a new mechanism that satisfies ex post incentive compatibility, individual rationality, feasibility, nonwastefulness, and no budget deficit. Moreover, this...

Distributional constraints are common features in many real matching markets, such as medical residency matching, school admissions, and teacher assignment. We develop a general theory of matching mechanisms under distributional constraints. We identify the necessary and sufficient condition on...

In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even...