In this paper we offer the reader an opportunity to inspect, at close hand, the substance and methodology of a special corner of descriptive game theory. The “simple games” that populate this area are finite, combinatorial structures that are not only amusing to mathematicians but can serve as abstract representations of voting systems or other group-decision procedures. As such, they have found applications in political science and organization theory, as well as in certain branches of pure mathematics.


Simple Game Winning Coalition Individual Player Minimal Winning Coalition Substitution Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. *.
    Theory of Games and Economic Behavior, Princeton University Press, 1944, 1947, 1953.Google Scholar
  2. **.
    Some recent examples: J. R. Isbell, “Homogeneous Games III” and L. S. Shapley, “Compound Simple Games,” in Advances in Game Theory: Annals of Mathematics Study-No, 52, Princeton University Press, 1964; W. H. Riker and L. S. Shapley, “Weighted voting: a mathematical analysis for instrumental judgments.” in Nomos X: Representation (Yearbook of the American Society for Political and Legal Philosophy), Atherton Press, New York, 1967. for a short expository article with a complete bibliography to date, see this author’s Simple games: an outline of the descriptive theory, RAND Corporation Paper P-2277, April 1961. (Also published without bibliography in Behavioral Science 7 (1962), pp. 59–66.)Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1967

Authors and Affiliations

  • L. S. Shapley
    • 1
  1. 1.The RAND CorporationUSA

Personalised recommendations