We perform an experimental test of Maskin's canonical mechanism for Nash implementation, using 3 subjects in non-repeated groups, as well as 3 outcomes, states of nature, and integer choices. We find that this mechanism succesfully implements the desired outcome a large majority of the time and...

In this paper we present a model of implementation based on the idea that agents renegotiate unfeasible allocations. We characterize the maximal set of Social Choice Correspondences that can be implemented in Nash Equilibrium with a class of renegotiation functions that do not reward agents for...

Suppose that a group of individuals owns collectively a technology which produces a consumptiongood by means of a (possibly heterogeneous) input. A sharing rule associates input contributionswith a vector of consumptions that are technologically feasible. We show that the set of...

In this paper we study a situation were the planner cannot commit to a mechanism and the outcome function is substituted by the planner herself. We assume 1) agents have complete information and play simultaneously; and 2) given the messages announced by the agents, the planner reacts in an...

In this paper we present a set of axioms guaranteeing that, in exchange economies with or without indivisible goods, the set of Nash, Strong and active Walrasian Equilibria all coincide in the framework of market games.

In this paper we explore the notion that players are decent, in the sensethat their choices are bound by certain unwritten social rules. We apply thisidea to two cases: bankruptcy and bargaining in exchange economies. Wecharacterize the results that are generated by such a behavior in the cases...