Asymmetric Information Bargaining Problems with Many Agents
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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 57 (1990)
Issue (Month): 3 ()
|Contact details of provider:|| |
When requesting a correction, please mention this item's handle: RePEc:oup:restud:v:57:y:1990:i:3:p:351-367.. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Oxford University Press)or (Christopher F. Baum)
If references are entirely missing, you can add them using this form.