Showing 1 - 10 of 27
We study the problem of dissolving an equal-entitlement partnership when the objective is to minimize maximum regret. We initially focus on the family of linear-pricing mechanisms and derive regret-optimizing strategies. We also demonstrate that there exist linear-pricing mechanisms satisfying...
Persistent link: https://www.econbiz.de/10012719936
This paper studies the problem of assigning a set of indivisible objects to a set of agents when monetary transfers are not allowed and agents reveal only ordinal preferences, but random assignments are possible. We offer two characterizations of the probabilistic serial mechanism, which assigns...
Persistent link: https://www.econbiz.de/10011019198
We report an experiment on the Probabilistic Serial (PS) mechanism for allocating indivisible goods. The PS mechanism, a recently discovered alternative to the widely used Random Serial Dictatorship mechanism, has attractive fairness and efficiency properties if people report their preferences...
Persistent link: https://www.econbiz.de/10010955338
We consider the problem of allocating several types of indivisible goods when preferences are separable and monetary transfers are not allowed. Our finding is that the coordinatewise application of strategy-proof and non-wasteful rules yields a strategy-proof rule with the following efficiency...
Persistent link: https://www.econbiz.de/10010955341
We report an experiment on the Probabilistic Serial (PS) mechanism for allocating indivisible goods. The PS mechanism, a recently discovered alternative to the widely used Random Serial Dictatorship mechanism, has attractive fairness and efficiency properties if people report their preferences...
Persistent link: https://www.econbiz.de/10010931194
Assume it is known that one player in a 2 x 2 game can detect the strategy choice of its opponent with some probability before play commences. We formulate conditions under which the detector can, by credibly committing to a strategy of probabilistic tit-for-tat (based on its imperfect...
Persistent link: https://www.econbiz.de/10011259811
Many procedures have been suggested for the venerable problem of dividing a set of indivisible items between two players. We propose a new algorithm (AL), related to one proposed by Brams and Taylor (BT), which requires only that the players strictly rank items from best to worst. Unlike BT, in...
Persistent link: https://www.econbiz.de/10011260855
Persistent link: https://www.econbiz.de/10005264471
Persistent link: https://www.econbiz.de/10005826728
Persistent link: https://www.econbiz.de/10005826773