This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Lexicographic composition of simple games

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
O'Neill, Barry
Peleg, Bezalel

Additional information is available for the following registered author(s):

Abstract

Certain 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 Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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://www.sciencedirect.com/science/article/B6WFW-4PPF69P-2/1/ef18804c56b426598284daa008c765cd
File Format:
File Function:
Download Restriction: Full text for ScienceDirect subscribers only

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.

Publisher Info
Article provided by Elsevier in its journal Games and Economic Behavior.

Volume (Year): 62 (2008)
Issue (Month): 2 (March)
Pages: 628-642
Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Handle: RePEc:eee:gamebe:v:62:y:2008:i:2:p:628-642

Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836

For technical questions regarding this item, or to correct its listing, contact: (Heidi Boesdal).

Related research
Keywords:

Other versions of this item:

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.:
  1. Pradeep Dubey & Abraham Neyman & Robert J. Weber, 1979. "Value Theory without Efficiency," Cowles Foundation Discussion Papers 513, Cowles Foundation, Yale University. [Downloadable!]
Full references

Statistics
Access and download statistics

Did you know? IDEAS is not the only service displaying RePEc data. Choose on RePEc which service fits your needs best.

This page was last updated on 2009-12-30.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.