Lexicographic composition of simple games
AbstractCertain voting bodies can be modeled as a simple game where a coalition's winning depends on whether it wins, blocks or loses in two smaller simple games. There are essentially five such ways to combine two proper games into a proper game. The most decisive is the lexicographic rule, where a coalition must either win in G1, or block in G1 and win in G2. When two isomorphic games are combined lexicographically, a given role for a player confers equal or more power when held in the first game than the second, if power is assessed by any semi-value. A game is lexicographically separable when the players of the two components partition the whole set. Games with veto players are not separable, and games of two or more players with identical roles are separable only if decisive. Some separable games are egalitarian in that they give players identical roles.
Download InfoIf 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.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 62 (2008)
Issue (Month): 2 (March)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Other versions of this item:
- Barry O'Neill & Bezalel Peleg, 2006. "Lexicographic Composition of Simple Games," Discussion Paper Series dp415, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- Barry O�Neill & Bezalel Peleg, 2006. "Lexicographic Composition of Simple Games," Levine's Bibliography 122247000000001223, UCLA Department of Economics.
- Barry O'Neill & Bezalel Peleg, 2006. "Lexicographic Composition of Simple Games," Cowles Foundation Discussion Papers 1559, Cowles Foundation for Research in Economics, Yale University.
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
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.:
- 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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
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.