Pairing Games or Markets studied here are the non-two-sided NTU generalization of assignment games. We show that the Equilibrium Set is nonempty, that it is the set of stable allocations or the set of semistable allocations, and that it has several notable structural properties. We also...

We develop a novel framework to analyze the structural implications of the marriage market for house-hold consumption patterns. We start by de…ning a revealed preference characterization of e¢ cient householdconsumption when the marriage is stable. In particular, stability means that the...

We present a theoretical explanation of inefficient early matching in matching markets. Our explanation is based on strategic complementarities and strategic unraveling. We identify a negative externality imposed on the rest of the market by agents who make early offers. As a consequence, an...

We develop a novel framework to analyze the structural implications of the marriage market for household consumption patterns. We start by defining a revealed preference characterization of efficient household consumption when the marriage is stable. In particular, stability means that the...

We develop a novel framework to analyze the structural implications of the marriage market for household consumption patterns. We start by defining a revealed preference characterization of efficient household consumption when the marriage is stable. In particular, stability means that the...

Pairing Games or Markets studied here are the non-two-sided NTU generalization of assignment games. We show that the Equilibrium Set is nonempty, that it is the set of stable allocations or the set of semistable allocations, and that it has several notable structural properties. We also...

Gale and Shapley (1962) proposed that there is a similar game to the marriage problem called "the roommate problem". And, they showed that unlike the marriage problem, the roommate problem may have unstable solutions. In other words, the stability theorem fails for the roommate problem. In this...

We know from Gale and Shapley (1962) that every Two-Sided Matching Game has a stable solution. It is also well-known that the number of stable matchings increases with the number of agents on both sides. In this paper, we propose two mechanisms, one of which is a variant of the other, to the...