Showing 1 - 10 of 33
Persistent link: https://www.econbiz.de/10005405606
Persistent link: https://www.econbiz.de/10005405626
Implementation in iteratively undominated strategies relies on permissive conditions. However, for the sufficiency results available, authors have relied on assumptions that amount to quasilinear preferences on a numeraire. We uncover a new necessary condition that implies that such assumptions...
Persistent link: https://www.econbiz.de/10008509888
We consider robust virtual implementation, where robustness is the requirement that implementation succeed in all type spaces consistent with a given payoff type space as well as with a given space of first-order beliefs about the other agents’ payoff types. This last bit, which constitutes...
Persistent link: https://www.econbiz.de/10010318934
We show the robustness of the Walrasian result obtained in models of bargaining in pairwise meetings. Restricting trade to take place only in pairs, most of the assumptions made in the literature are dispensed with. These include assumptions on preferences (differentiability, monotonicity,...
Persistent link: https://www.econbiz.de/10010318969
We come close to characterizing the class of social choice correspondences that are implementable in rationalizable strategies. We identify a new condition, which we call set-monotonicity, and show that it is necessary and almost sufficient for rationalizable implementation. Set-monotonicity is...
Persistent link: https://www.econbiz.de/10011669323
Implementation in iteratively undominated strategies relies on permissive conditions. However, for the sufficiency results available, authors have relied on assumptions that amount to quasilinear preferences on a numeraire. We uncover a new necessary condition that implies that such assumptions...
Persistent link: https://www.econbiz.de/10010284046
We uncover a new necessary condition for implementation in iteratively undominated strategies by mechanisms that satisfy the “best element property” where for each agent, there exists a strategy profile that gives him the highest payoff in the mechanism. This class includes finite and...
Persistent link: https://www.econbiz.de/10011042920
We study a mechanism design problem where arbitrary restrictions are placed on the sets of first-order beliefs of agents. Calling these restrictions Δ, we use Δ-rationalizability (Battigalli and Siniscalchi, 2003, [5]) as our solution concept, and require that a mechanism virtually implement a...
Persistent link: https://www.econbiz.de/10011042982