IDEAS home Printed from
   My bibliography  Save this article

On the structure of minimal winning coalitions in simple voting games


  • Maria Axenovich


  • Sonali Roy



According to Colemanï¾’s index of collective power, a decision rule that generates a larger number of winning coalitions imparts the collectivity a higher a priori power to act. By the virtue of the monotonicity conditions, a decision rule is totally characterized by the set of minimal winning coalitions. In this paper, we investigate the structure of the families of minimal winning coalitions corresponding to maximal and proper simple voting games (SVG).We show that if the proper and maximal SVG is swap robust and all the minimal winning coalitions are of the same size, then the SVG is a specific (up to an isomorphism) system.We also provide examples of proper SVGs to show that the number of winning coalitions is not monotone with respect to the intuitively appealing system parameters like the number of blockers, number of non-dummies or the size of the minimal blocking set.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Maria Axenovich & Sonali Roy, 2010. "On the structure of minimal winning coalitions in simple voting games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 34(3), pages 429-440, March.
  • Handle: RePEc:spr:sochwe:v:34:y:2010:i:3:p:429-440
    DOI: 10.1007/s00355-009-0408-2

    Download full text from publisher

    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    1. J. Freixas & M.A. Puente, 1998. "Complete games with minimum," Annals of Operations Research, Springer, vol. 84(0), pages 97-109, December.
    2. Barua, Rana & Chakravarty, Satya R. & Roy, Sonali & Sarkar, Palash, 2004. "A characterization and some properties of the Banzhaf-Coleman-Dubey-Shapley sensitivity index," Games and Economic Behavior, Elsevier, vol. 49(1), pages 31-48, October.
    3. Carreras, Francesc & Freixas, Josep, 1996. "Complete simple games," Mathematical Social Sciences, Elsevier, vol. 32(2), pages 139-155, October.
    Full references (including those not matched with items on IDEAS)

    More about this item


    Access and download statistics


    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:spr:sochwe:v:34:y:2010:i:3:p:429-440. 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: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: .

    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.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.