A yes or no decision must be made about some issue. All agents must agree. The “Coase Theorem” asserts that the efficient outcome will always result. Suppose the value (positive or negative) that an individual attaches to an affirmative decision is privately known to that individual. It is proved, under very mild conditions, that with independent types, as the number of agents increases, the probability of an affirmative efficient decision goes to zero. An example in which it is common knowledge that an affirmative decision is efficient and yet the probability of such a decision goes to zero is given.

We introduce a distinction between a firm and its network of workers. In a competitive world, if networks are easily lured away, the workers must receive the entire value of their contribution to the firm. How then can service firms have equity value? A model is analysed in which workers are paid less as a group than their value, even in a competitive world. The workers are assumed to have a nonwage benefit for working at the current firm; this benefit is privately known. These privately known benefits make it impossible for the workers to agree on a division of their value should they leave the existing firm for a new enterprise. The result is that the workers may receive a total compensation that is less than their contribution to the firm.

We analyze the problem in which agents have non-public information and are to play an asymmetric information game. The agents may reveal some or all of their information to other agents prior to playing this game. Revelation is via exogenously specified certifiable statements. The equilibria resulting from various revelation strategies are used to determine equilibrium revelation of information. Sufficient conditions are provided for complete revelation of all private information. A number of examples are provided illustrating when revelation will or will not occur in commonly analyzed games.