Showing 1 - 10 of 640
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...
Persistent link: https://www.econbiz.de/10010332209
This paper considers the problem of allocating N indivisible objects among N agents according to their preferences when transfers are not allowed, and studies the tradeoff between fairness and efficiency in the class of strategy-proof mechanisms. The main finding is that for strategy-proof...
Persistent link: https://www.econbiz.de/10010438227
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...
Persistent link: https://www.econbiz.de/10003397473
We observe that three salient solutions to matching, division and house allocation problems are not only (partially) strategy-proof, but (partially) group strategy-proof as well, in appropriate domains of definition. That is the case for the Gale-Shapley mechanism, the uniform rule and the top...
Persistent link: https://www.econbiz.de/10013033174
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 efficient and individually rational matching rules are manipulable in the one-to-one matching model. We pursue the possibility of strategy-proof...
Persistent link: https://www.econbiz.de/10014053961
We observe that many salient rules to allocate private goods are not only (partially) strategy-proof, but also (partially) group strategy-proof, in appropriate domains of definition. That is so for solutions to matching, division, cost sharing, house allocation and auctions, in spite of the...
Persistent link: https://www.econbiz.de/10013031379
This paper studies the strategic foundations of the Representative Voter Theorem (Rothstein, 1991), also called the second version of the Median Voter Theorem. As a by-product, it also considers the existence of non-trivial strategy-proof social choice functions over the domain of...
Persistent link: https://www.econbiz.de/10010323146
A high court has to decide whether a lawis constitutional, unconstitutional, or interpretable. The voting system is runoff. Runoff voting systems can be interpreted both, as social choice functions or as mechanisms. It is known that, for universal domains of preferences, runoff voting systems...
Persistent link: https://www.econbiz.de/10010317080
In this note, we use the technique of option sets to sort out the implications of coalitional strategyproofness in the spatial setting. We also discuss related issues and open problems.
Persistent link: https://www.econbiz.de/10010317113