Advanced Search
MyIDEAS: Login

Lexicographic Composition of Simple Games

Contents:

Author Info

  • Barry O'Neill

    (University of California, Los Angeles)

  • Bezalel Peleg

    (Hebrew University of Jerusalem)

Abstract

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.

Download Info

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.
File URL: http://cowles.econ.yale.edu/P/cd/d15b/d1559.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Cowles Foundation for Research in Economics, Yale University in its series Cowles Foundation Discussion Papers with number 1559.

as in new window
Length: 24 pages
Date of creation: Feb 2006
Date of revision:
Publication status: Published in Games and Economic Behavior (2008), 62: 628-642
Handle: RePEc:cwl:cwldpp:1559

Contact details of provider:
Postal: Yale University, Box 208281, New Haven, CT 06520-8281 USA
Phone: (203) 432-3702
Fax: (203) 432-6167
Web page: http://cowles.econ.yale.edu/
More information through EDIRC

Order Information:
Postal: Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA

Related research

Keywords: simple games; voting; game composition; game decomposition; semi-value; decisiveness; fairness;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Pradeep Dubey & Abraham Neyman & Robert J. Weber, 1979. "Value Theory without Efficiency," Cowles Foundation Discussion Papers 513, Cowles Foundation for Research in Economics, Yale University.
Full references (including those not matched with items on IDEAS)

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:cwl:cwldpp:1559. 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: (Glena Ames).

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 references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link 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 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.