IDEAS home Printed from https://ideas.repec.org/p/nbr/nberwo/30991.html
   My bibliography  Save this paper

Organizing for Collective Action: Olson Revisited

Author

Listed:
  • Marco Battaglini
  • Thomas R. Palfrey

Abstract

We study a standard collective action problem in which successful achievement of a group interest requires costly participation by some fraction of its members. How should we model the internal organization of these groups when there is asymmetric information about the preferences of their members? How effective should we expect it to be as we increase the group’s size n? We model it as an optimal honest and obedient communication mechanism and we show that for large n it can be implemented with a very simple mechanism that we call the Voluntary Based Organization. Two new results emerge from this analysis. Independently of the assumptions on the underlying technology, the limit probability of success in the best honest and obedient mechanism is the same as in an unorganized group, a result that is not generally true if obedience is omitted. An optimal organization, however, provides a key advantage: when the probability of success converges to zero, it does so at a much slower rate than in an unorganized group. Because of this, significant probabilities of success are achievable with simple honest and obedient organizations even in very large groups.

Suggested Citation

  • Marco Battaglini & Thomas R. Palfrey, 2023. "Organizing for Collective Action: Olson Revisited," NBER Working Papers 30991, National Bureau of Economic Research, Inc.
  • Handle: RePEc:nbr:nberwo:30991
    Note: PE POL
    as

    Download full text from publisher

    File URL: http://www.nber.org/papers/w30991.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Paula Onuchic & Jo~ao Ramos, 2023. "Disclosure and Incentives in Teams," Papers 2305.03633, arXiv.org.

    More about this item

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:nbr:nberwo:30991. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/nberrus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.