Showing 1 - 10 of 552
A common real-life problem is to fairly allocate a number of indivisible objects and a fixed amount of money among a group of agents. Fairness requires that each agent weakly prefers his consumption bundle to any other agent's bundle. In this context, fairness is incompatible with budget-balance...
Persistent link: https://www.econbiz.de/10011674186
This paper studies the possibility of strategy-proof rules yielding satisfactory solutions to matching problems …. Alcalde and Barberá (1994) show that effcient and individually rational matching rules are manipulable in the one …-to-one matching model. We pursue the possibility of strategy-proof matching rules by relaxing effciency to the weaker condition of …
Persistent link: https://www.econbiz.de/10010332209
-proof mechanism that is constrained efficient, i.e. that always produces a stable matching that is not Pareto-dominated by another … stable matching. We characterize all solvable priority structures satisfying the following two restrictions: (A) Either there …
Persistent link: https://www.econbiz.de/10011937252
This paper studies the possibility of strategy-proof rules yielding satisfactory solutions to matching problems …. Alcalde and Barberá (1994) show that effcient and individually rational matching rules are manipulable in the one …-to-one matching model. We pursue the possibility of strategy-proof matching rules by relaxing effciency to the weaker condition of …
Persistent link: https://www.econbiz.de/10003397473
(partially) group strategy-proof, in appropriate domains of definition. That is so for solutions to matching, division, cost …
Persistent link: https://www.econbiz.de/10013031379
We study Nash implementation in many-to-one matching problems also known as college admission problems [Gale and … although subsolutions of the stable many-to-one matching rule do not in general satisfy no veto power, monotonicity is not only …
Persistent link: https://www.econbiz.de/10014157176
We observe that three salient solutions to matching, division and house allocation problems are not only (partially …
Persistent link: https://www.econbiz.de/10013033174
We consider school choice problems (Abdulkadiroglu and Sönmez, 2003) where students are assigned to public schools through a centralized assignment mechanism. We study the family of so-called rank-priority mechanisms, each of which is induced by an order of rank-priority pairs. Following the...
Persistent link: https://www.econbiz.de/10012955586
This paper studies the possibility of strategy-proof rules yielding satisfactory solutions to matching problems …. Alcalde and Barberá (1994) show that efficient and individually rational matching rules are manipulable in the one …-to-one matching model. We pursue the possibility of strategy-proof matching rules by relaxing efficiency to the weaker condition of …
Persistent link: https://www.econbiz.de/10014053961
-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that …In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy …
Persistent link: https://www.econbiz.de/10011694986