IDEAS home Printed from
   My bibliography  Save this paper

Lexicographic Composition of Simple Games


  • Barry ONeill
  • Bezalel Peleg


A two-house legislature can often be modelled as a proper simple game whose outcome depends on whether a coalition wins, blocks or loses in two smaller proper simple games. It is shown that there are exactly five ways to combine the smaller games into a larger one. This paper focuses on one of the rules, lexicographic composition, where a coalition wins G_1 => G_2 when it either wins in G_1, or blocks in G_1 and wins in G_2. It is the most decisive of the five. A lexicographically decomposable game is one that can be represented in this way using components whose player sets partition the whole set. Games with veto players are not decomposable, and anonymous games are decomposable if and only if they are decisive and have two or more players. If a player's benefit is assessed by any semi-value, then for two isomorphic games a player is better off from having a role in the first game than having the same role in the second. Lexicographic decomposability is sometimes compatible with equality of roles. A relaxation of it is suggested for its practical benefits.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Barry ONeill & Bezalel Peleg, 2006. "Lexicographic Composition of Simple Games," Levine's Bibliography 122247000000001223, UCLA Department of Economics.
  • Handle: RePEc:cla:levrem:122247000000001223

    Download full text from publisher

    File URL:
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    1. Pradeep Dubey & Abraham Neyman & Robert James Weber, 1981. "Value Theory Without Efficiency," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 122-128, February.
    2. Pradeep Dubey & Lloyd S. Shapley, 1979. "Mathematical Properties of the Banzhaf Power Index," Mathematics of Operations Research, INFORMS, vol. 4(2), pages 99-131, May.
    Full references (including those not matched with items on IDEAS)


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

    Cited by:

    1. Yokote, Koji & Funaki, Yukihiko & Kamijo, Yoshio, 2016. "A new basis and the Shapley value," Mathematical Social Sciences, Elsevier, vol. 80(C), pages 21-24.
    2. Rudolf Berghammer & Agnieszka Rusinowska & Harrie de Swart, 2009. "A Relation-algebraic Approach to Simple Games," Working Papers 0913, Groupe d'Analyse et de Théorie Economique Lyon St-Étienne (GATE Lyon St-Étienne), Université de Lyon.

    More about this item

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations

    NEP fields

    This paper has been announced in the following NEP Reports:


    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:cla:levrem:122247000000001223. 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: (David K. Levine). 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.