Showing 1 - 10 of 2,670
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/10011599453
In this paper we investigate some new applications of Scarf's Lemma. First, we introduce the notion of fractional core … interpretation of these results for matching games. Finally we consider an even more general setting where players' contributions in … in many practical applications, such as NRMP (National Resident Matching Program). …
Persistent link: https://www.econbiz.de/10010494519
. The core predicts a unique and extreme outcome: the entire surplus is split evenly among the buyers when m > n and among … the sellers when m < n; the long side gets nothing. We test this core conjecture in the lab with n + m = 3 or 5 randomly … agreements while trading. Despite frequent attempts to collude and occasional large deviations from the core prediction, we find …
Persistent link: https://www.econbiz.de/10010288168
The ex ante incentive compatible core of an exchange economy with private information is the (standard) core of a … incentive compatible core can be empty, even if utility functions are quasi-linear. If, in addition to quasi-linearity, further … assumptions are made (like independent private values), the non-emptiness of the core follows nevertheless from d?Aspremont and …
Persistent link: https://www.econbiz.de/10010273735
(weak) core, unlike in many-to-one matching markets (Blair, 1988). In this paper, we seek a theoretical foundation for …It is known that in two-sided many-to-many matching markets, pair-wise stability is not logically related with the …-partner matching problem that includes two-sided matching problems as special cases. Under the same preference restriction, we also …
Persistent link: https://www.econbiz.de/10011325144
Ostrovsky [10] develops a theory of stability for a model of matching in exogenously given networks. For this model a … core stability of chain stable networks, (iii) the efficiency of chain stable networks, (iv) the existence of a group … with the core are also characterized. …
Persistent link: https://www.econbiz.de/10010270419
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 …
Persistent link: https://www.econbiz.de/10011709879
A coalitional matching is a two-sided matching problem in which agents on each side of the market may form coalitions … would like to learn from. In this setup, we examine how the existence of core stable partitions on the distinct market sides … respect common rankings shape the existence of core stable coalitional matchings. …
Persistent link: https://www.econbiz.de/10010270953
We propose positive and normative foundations for the average prekernel of NTU games, and compare them with the existing ones for the prekernel. In our non-cooperative analysis, the average prekernel is understood as the equilibrium payoffs of a game where each player faces the possibility of...
Persistent link: https://www.econbiz.de/10010318958
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/10011380988