The Slutsky matrix function encodes all the information about local variations in demand with respect to small (Slutsky) compensated price changes. When the demand function is the result of utility maximization the Slutsky matrix is symmetric. However, symmetry does not imply rationality. Here,...

The Slutsky matrix function encodes all the information about local variations in demand with respect to small (Slutsky) compensated price changes. When the demand function is the result of utility maximization the Slutsky matrix is symmetric. However, symmetry does not imply rationality. Here,...

Restricting attention to economic environments, we study implementation under perturbed better-response dynamics (BRD). A social choice function (SCF) is implementable in stochastically stable strategies of perturbed BRD whenever the only outcome supported by the stochastically stable strategies...

Consider the problem of information disclosure for a planner who faces two agents interacting in a state-dependent multi-action prisoners' dilemma. We find conditions under which the planner can make use of his superior information by disclosing some of it to the agents, and conditions under...

This is a brief survey describing some of the recent progress and open problems in the area of cooperative games with incomplete information. We discuss exchange economies, cooperative Bayesian games with orthogonal coalitions, and issues of cooperation in non-cooperative Bayesian games.

This is a brief survey describing some of the recent progress and open problems in the area of cooperative games with incomplete information. We discuss exchange economies, cooperative Bayesian games with orthogonal coalitions, and issues of cooperation in non-cooperative Bayesian games.

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

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 study the classic implementation problem under the behavioral assumption that agents myopically adjust their actions in the direction of better-responses or best-responses. First, we show that a necessary condition for recurrent implementation in better-response dynamics (BRD) is a small...

We study a strategic model of dynamic trading where agents are asymmetrically informed over common value sources of uncertainty. There is a continuum of buyers and a finite number n of sellers. All buyers are uninformed, while at least one seller is privately informed about the true state of the...