Munich Personal RePEc Archive

A note on Jackson's theorems in Bayesian implementation

Saglam, Ismail (1997): A note on Jackson's theorems in Bayesian implementation.

This is the latest version of this item.

[thumbnail of MPRA_paper_7253.pdf]

Download (2MB) | Preview


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 theorems that whenever 'connection' holds and there are at least three agents in the society, for the implementability of social choice sets in Bayesian equilibrium, incentive compatibility and Bayesian monotonicity conditions are both necessary and sufficient in economic environments whereas incentive compatibility and monotonicity-no-veto conditions are sufficient in noneconomic environments.

Available Versions of this Item

Atom RSS 1.0 RSS 2.0

Contact us: mpra@ub.uni-muenchen.de

This repository has been built using EPrints software.

MPRA is a RePEc service hosted by Logo of the University Library LMU Munich.