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
We prove a “General Manipulability Theorem” for general one-to-one two-sided matching markets with money. This theorem implies two folk theorems, the Manipulability Theorem and the General Impossibility Theorem, and provides a sort of converse of the Non-Manipulability Theorem (Demange,...
Persistent link: https://www.econbiz.de/10010851337
We prove two Folk Theorems which, together with the Non-Manipulability Theorem (Demange (1982) and Leonard (1983)), have stimulated the development of the theory on incentives for the one-to-one two-sided matching models with money as a continuous variable.
Persistent link: https://www.econbiz.de/10010875475
We prove a “General Manipulability Theorem” for general one-to-one two-sided matching markets with money. This theorem implies two folk theorems, the Manipulability Theorem and the General Impossibility Theorem, and provides a sort of converse of the Non-Manipulability Theorem (Demange,...
Persistent link: https://www.econbiz.de/10010875486
A dynamic game where agents "behave cooperatively" is postulated: At each stage, current nontrading agents can trade and the payoffs from transactions done are maintained in the subsequent stages. The game ends when no interaction is able to benefit the agents involved (case in which a core...
Persistent link: https://www.econbiz.de/10010875487
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
Aiming to obtain new characterizations for the concepts of core, cooperative equilibrium and competitive equilibrium, and new correlations among these concepts, we introduce labor time into the assignment game. Two many-to-many matching models are obtained, distinguished by the nature of the...
Persistent link: https://www.econbiz.de/10010610415
Persistent link: https://www.econbiz.de/10005826728