Lexicographic Composition of Simple Games
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.)
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 James Weber, 1981.
"Value Theory Without Efficiency,"
Mathematics of Operations Research,
INFORMS, vol. 6(1), pages 122-128, February.
- 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.
- 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)