cannot include matchings that are not in the core. Moreover, we show that our main result is robust to many-to-one matching … stable when agents are farsighted in one-to-one matching problems. We provide the characterization of vNM farsightedly stable … sets: a set of matchings is a vNM farsightedly stable set if and only if it is a singleton subset of the core. Thus …

Using a bi-choice graph technique (Klaus and Klijn, 2009), we show that a matching for a roommate market indirectly … dominates another matching if and only if no blocking pair of the former is matched in the latter (Proposition 1). Using this … von Neumann-Morgenstern farsightedly stable if and only if the matching is stable (Theorem 1). We also present roommate …

existence of equilibrium. We then apply the solution concept to a matching-based Cournot model in which the unit production cost … technology and human capital are complementary, the positive assortative matching (PAM) is a stable matching under rational … marginal effects of technology and human capital, the PAM is still a rational stable matching. However, if the substitutive …

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 …

We propose a dynamic model of decentralized many-to-one matching in the context of a competitive labor market. Through … are currently employed/unemployed. We show that such a process is absorbed into the core with probability one in finite … time. Moreover, within the core, allocations are selected that are characterized by surplus splitting according to a …

stable solutions of a multiple partners matching game in two different ways and perform a study on the core of the …We generalize two well-known game-theoretic models by introducing multiple partners matching games, defined by a graph … the existence of a stable solution and the non-emptiness of the core, which holds in the other models with payments, is no …

coalition forms without delay in equilibrium, expected payoffs must be in the core of the characteristic function game that …

of the extended cores of all μ-compatible subgames, for a given optimal matching μ, is the core with respect to those …In this paper, we study different notions of stability for three-sided assignment games. Since the core may be empty in …-Morgenstern stable sets. The dominant diagonal property is necessary for the core to be a stable set, and also sufficient in the case …

Decentralized matching markets on the internet allow large numbers of agents to interact anonymously at virtually no … sell-side). This simple and intuitive learning process implements core allocations even though agents have no knowledge of …