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...

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...

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 our...