Showing 1 - 10 of 42,334
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 …
Persistent link: https://www.econbiz.de/10011691082
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...
Persistent link: https://www.econbiz.de/10010350435
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 …
Persistent link: https://www.econbiz.de/10013159464
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 …
Persistent link: https://www.econbiz.de/10010191642
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 …
Persistent link: https://www.econbiz.de/10014219020
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 …
Persistent link: https://www.econbiz.de/10011345044
coalition forms without delay in equilibrium, expected payoffs must be in the core of the characteristic function game that …
Persistent link: https://www.econbiz.de/10012650908
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 …
Persistent link: https://www.econbiz.de/10012011087
We provide a new proof of the non-emptiness of approximate cores of games with many players of a finite number of types. Earlier papers in the literature proceed by showing that, for games with many players, equal-treatment cores of their "balanced cover games", which are non-empty, can be...
Persistent link: https://www.econbiz.de/10010472889
strongly balanced and the core is described by means of the cores of the underlying two-sided assignment games associated with … between core and competitive equilibria is established …
Persistent link: https://www.econbiz.de/10012964721