Fair stable sets of simple games
Games and Economic Behavior, 2018, vol. 108, issue C, 574-584
Simple games are abstract representations of voting systems and other group-decision procedures. A stable set—or von Neumann–Morgenstern solution—of a simple game represents a “standard of behavior” that satisfies certain internal and external stability properties. Compound simple games are built out of component games, which are, in turn, “players” of a quotient game. I describe a method to construct fair—or symmetry-preserving—stable sets of compound simple games from fair stable sets of their quotient and components. This method is closely related to the composition theorem of Shapley (1963c), and contributes to the answer of a question that he formulated: What is the set G of simple games that admit a fair stable set? In particular, this method shows that the set G includes all simple games whose factors—or quotients in their “unique factorization” of Shapley (1967)—are in G, and suggests a path to characterize G.
Keywords: Fair stable set; Simple game; Compound simple game; Symmetry; Aggregation (search for similar items in EconPapers)
JEL-codes: C71 (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations Track citations by RSS feed
Downloads: (external link)
Full text for ScienceDirect subscribers only
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:eee:gamebe:v:108:y:2018:i:c:p:574-584
Access Statistics for this article
Games and Economic Behavior is currently edited by E. Kalai
More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Dana Niculescu ().