Matching markets can be unstable when individuals prefer to be matched to a partner who also wants to be matched with … preferences exist, significantly decrease stability in matching markets, and are driven both by belief-based and preference …

It is known that in two-sided many-to-many matching markets, pair-wise stability is not logically related with the … (weak) core, unlike in many-to-one matching markets (Blair, 1988). In this paper, we seek a theoretical foundation for …-partner matching problem that includes two-sided matching problems as special cases. Under the same preference restriction, we also …

students often fail to grasp the strategic issues involved. The modified SDA algorithm significantly improves the matching for …

students often fail to grasp the strategic issues involved. The modified SDA algorithm significantly improves the matching for …

students often fail to grasp the strategic issues involved. The modified SDA algorithm significantly improves the matching for …

game. Conversely, the set of repeated matching (or social) equilibria also includes some plays that are not part of any … definitions, as well as the relationship to renegotiation-proof equilibrium. It is possible for repeated matching equilibria to be …

This paper develops a framework for studying repeated matching markets. The model departs from the Gale …-Shapley matching model by having a fixed set of long-lived players (firms) match with a new generation of short-lived players (workers …) in every period. I define history-dependent and self-enforcing matching processes in this repeated matching environment …

Ostrovsky [10] develops a theory of stability for a model of matching in exogenously given networks. For this model a …

when agents are farsighted in one-to-one matching problems. We provide the characterization of von Neumann … set and its element is a corewise stable matching. Thus, contrary to the von Neumann-Morgenstern (myopically) stable sets … show that our main result is robust to many- to-one matching problems with responsive preferences. …

In this paper we consider one-to-many matching problems where the preferences of the agents involved are represented by … matching to a matching of maximum total reward, one can always provide a compensation schedule that will be ex-post stable in … uses the fact that the core of an associated compensation matching game with constraints is nonempty. …