We consider general social choice environments with private values and correlated types. Each agent's matrix of conditional probabilities satisfies the full rank condition. We show that for any Bayesian incentive compatible mechanism there exists a dominant strategy incentive compatible...

For any linear transformation and two convex closed sets, we provide necessary and sufficient conditions for when the transformation of the intersection of the sets coincides with the intersection of their images. We also identify analogous conditions for non-convex sets, general...

The Prisoner's Dilemma is a simple model that captures the essential contradiction between individual rationality and global rationality. Although the single-shot Prisoner's Dilemma is usually viewed simple, in this paper we will propose an algorithmic model and a non-binding scheme to help...

This paper shows that in an incomplete information situation if the set of states of the society which occur with positive probability satisfies 'connection' condition, then closure condition will be satisfied by all social choice sets. It then follows from Jackson's (1991) two fundamental...

This paper unifies the theories of Nash implementation and Bayesian implementation in a single framework. Environments considered are such that each agent's characteristics include, in addition to a specification of his private information, a commonly known type parameter, while both attributes...

We consider a standard social choice environment with linear utility and one-dimensional types. We show by counterexample that, when there are at least three physical alternatives, Bayes-Nash Incentive Compatibility (BIC) and Dominant Strategy Incentive Compatibility (DIC) need no longer be...

This paper studies the revelation principle for mechanisms with limited commitment when agents have correlated persistent types over the infinite horizon. After characterizing necessary and sufficient conditions to construct a mechanism with same ex-ante payoffs and interim beliefs to all...

This note establishes a revelation principle in terms of payoff for deterministic mechanisms under ex-post constraints: the maximal payoff implementable by a feasible deterministic mechanism can also be implemented by a feasible deterministic direct mechanism.

In mechanism design with (partially) verifiable information, the revelation principle holds if allocations are modelled as the Cartesian product of outcomes and verifiable information, giving rise to evidence-contingent mechanisms. Consequently, incentive constraints characterize the...