Showing 1 - 10 of 3,986
structure of a matching. This paper argues that, under indifferences, also weak blockings should be considered when these … the set of Pareto-stable matchings for the roommate and the marriage models is provided in terms of individually rational … of stable matchings. Some properties of the Pareto-stable matchings shared by the Marriage and Roommate models are …
Persistent link: https://www.econbiz.de/10010284048
Starting with an initial price vector, prices are adjusted in order to eliminate the demand excess and at the same time to keep the transfers to the sellers as low as possible. In each step of the auction, to which sellers should those transfers be made (minimal overdemanded sets) is the key...
Persistent link: https://www.econbiz.de/10010284074
We investigate the matching algorithm used by the German central clearinghouse for university admissions (ZVS) in … criteria applied for admission they all make use of priority matching. In priority matching schemes, it is not a dominant … applicants, we are able to detect some amount of strategic behaviour which can lead to inefficient matching. Alternative ways to …
Persistent link: https://www.econbiz.de/10010264992
We investigate the matching algorithm used by the German central clearinghouse for university admissions (ZVS) in … criteria applied for admission they all make use of priority matching. In priority matching schemes, it is not a dominant … applicants, we are able to detect some amount of strategic behaviour which can lead to inefficient matching. Alternative ways to …
Persistent link: https://www.econbiz.de/10010271836
students often fail to grasp the strategic issues involved. The modified SDA algorithm significantly improves the matching for …
Persistent link: https://www.econbiz.de/10010307931
students often fail to grasp the strategic issues involved. The modified SDA algorithm significantly improves the matching for …
Persistent link: https://www.econbiz.de/10010286341
students often fail to grasp the strategic issues involved. The modified SDA algorithm significantly improves the matching for …
Persistent link: https://www.econbiz.de/10010281521
I consider the problem of assigning agents to indivisible objects, in which each agent pays a price for his object and all prices sum to a given constant. The objective is to select an assignment-price pair that is envy-free with respect to the agents' true preferences. I propose a simple...
Persistent link: https://www.econbiz.de/10010322828
We study decentralized task coordination. Tasks are of varying complexity and agents asymmetric: agents capable of completing high-level tasks may also take on tasks originally contracted by lower-level agents, facilitating system-wide cost reductions. We suggest a family of decentralized...
Persistent link: https://www.econbiz.de/10012304467
We consider general two-sided matching markets, so-called matching with contracts markets as introduced by Hatfield and … Milgrom (2005), and analyze (Maskin) monotonic and Nash implementable solutions. We show that for matching with contracts …
Persistent link: https://www.econbiz.de/10010272554