Showing 1 - 10 of 18,218
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 …
Persistent link: https://www.econbiz.de/10009756276
. 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
In a dynamic model of assignment problems, small deviations suffice to move between stable outcomes. This result is used to obtain no-selection and almost-no-selection results under the stochastic stability concept for uniform and payoff-dependent errors. There is no-selection of partner or...
Persistent link: https://www.econbiz.de/10010376447
buy (sell) a single unit of an indivisible good. The core predicts a unique and extreme outcome: the entire surplus is … split evenly among the buyers when m gt; n and among the sellers when m lt; n; the long side gets nothing. We test this core … deviations from the core prediction, we find that successful collusion is infrequent in both new institutions. A disproportionate …
Persistent link: https://www.econbiz.de/10012722945
. 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/10003782414
We consider the problem of axiomatizing the Shapley value on the class of assignment games. We first show that several axiomatizations of the Shapley value on the class of all TU-games do not characterize this solution on the class of assignment games by providing alternative solutions that...
Persistent link: https://www.econbiz.de/10014040150
One-sided assignment problems combine important features of two well-known matching models. First, as in roommate … problems, any two agents can be matched and second, as in two-sided assignment problems, the payoffs of a matching can be … with a non-empty core), if a subsolution of the core satisfies [indifference with respect to dummy agents, continuity, and …
Persistent link: https://www.econbiz.de/10014207008
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