COMPOUND SIMPLE GAMES 1: SOLUTIONS OF SUMS AND PRODUCTS

Abstract

This is an inve tigation of the solutions of the games that are formed by combining two or more simple games, played by separate groups of individuals. A simple game is one that is completely specified by its winning coalitions. Two forms of combination are studied in detail in this Memorandum: the sum, in which a coalition wins if it wins in either component, and the product, in which a coalition wins only if it wins in both components. In both cases, relationships are established between the solutions of the compound games and those of the components.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1962
Accession Number
AD0278261

Entities

People

  • Lloyd Shapley

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Air Force
  • Behavioral Sciences
  • California
  • Construction
  • Corporations
  • Curvature
  • Decomposition
  • Geometry
  • Government Procurement
  • Governments
  • Inequalities
  • Mathematics
  • Notation
  • Numbers
  • Real Numbers
  • United States

Fields of Study

  • Economics

Readers

  • Game Theory.
  • Regression Analysis.
  • Snow Cover Descriptors for Reptiles and Their Illustrations.