Showing 1 - 10 of 57
Persistent link: https://www.econbiz.de/10005598512
Persistent link: https://www.econbiz.de/10010994607
Persistent link: https://www.econbiz.de/10010998959
We introduce a compromise value for non-transferable utility games: the Chi-compromise value. It is closely related to the Compromise value introduced by Borm, Keiding, McLean, Oortwijn, and Tijs (1992), to the MC-value introduced by Otten, Borm, Peleg, and Tijs (1998), and to the Ω-value...
Persistent link: https://www.econbiz.de/10010999663
We introduce a compromise value for non-transferable utility games: the Chi-compromise value. It is closely related to the Compromise value introduced by Borm, Keiding, McLean, Oortwijn, and Tijs (1992), to the MC-value introduced by Otten, Borm, Peleg, and Tijs (1998), and to the Ω-value...
Persistent link: https://www.econbiz.de/10010847625
We study how to partition a set of agents in a stable way when each coalition in the partition has to share a unit of a perfectly divisible good, and each agent has symmetric single-peaked preferences on the unit interval of his potential shares. A rule on the set of preference profiles consists...
Persistent link: https://www.econbiz.de/10010851353
We propose a simple criterion to compare generalized median voter schemes according to their manipulability. We identify three necessary and sufficient conditions for the comparability of two generalized median voter schemes in terms of their vulnerability to manipulation. The three conditions...
Persistent link: https://www.econbiz.de/10010851361
The division problem under constraints consists of allocating a given amount of an homogeneous and perfectly divisible good among a subset of agents with single-peaked preferences on an exogenously given interval of feasible allotments. We characterize axiomatically the family of extended...
Persistent link: https://www.econbiz.de/10010851412
A multiple-partners assignment game with heterogeneous sales and multi-unit demands consists of a set of sellers that own a given number of indivisible units of potentially many different goods and a set of buyers who value those units and want to buy at most an exogenously fixed number of...
Persistent link: https://www.econbiz.de/10011000016
We study cooperative and competitive solutions for a many- to-many generalization of Shapley and Shubik (1972)s assignment game. We consider the Core, three other notions of group stability and two alternative definitions of competitive equilibrium. We show that (i) each group stable set is...
Persistent link: https://www.econbiz.de/10011019700