Pacific Journal of Mathematics

Kernels of compound games with simple components.

Nimrod Megiddo

Article information

Source
Pacific J. Math., Volume 50, Number 2 (1974), 531-555.

Dates
First available in Project Euclid: 8 December 2004

Permanent link to this document
https://projecteuclid.org/euclid.pjm/1102913239

Mathematical Reviews number (MathSciNet)
MR0347380

Zentralblatt MATH identifier
0254.90065

Subjects
Primary: 90D12

Citation

Megiddo, Nimrod. Kernels of compound games with simple components. Pacific J. Math. 50 (1974), no. 2, 531--555. https://projecteuclid.org/euclid.pjm/1102913239


Export citation

References

  • [1] R. J. Aumann, B. Peleg, and D. Rabinowitz, A method for computing the kernel of n-person games, Mathematics of Computation, 19 (1965), 531-551.
  • [2] M. Davis and M. Maschler, The kernel of a cooperative game, Naval Research Logistics Quarterly, 12 (1965), 223-259.
  • [3] A. Kopelowitz, Computation of the kernels of simple games and of the nucleolus of n-person games, Research Program in Game Theory and Mathematical Economics, Research Memorandum No. 31, Department of Mathematics, The Hebrew University of Jerusalem, Jerusalem, 1967.
  • [4] M. Maschler and B. Peleg, A characterization, existence proof and dimension bounds for the kernel of a game, Pacific J. Math., 18 (1966), 289-328.
  • [5] M. Maschler and B. Peleg, The structure of the kernel of a cooperative game, SIAM J. Appl. Math., 15 (1967), 569-604.
  • [6] N. Megiddo, The kernel and the nucleolus of a product of simple games, Israel J. Math., 9 (1971), 210-221.
  • [7] N. Megiddo, Tensor decomposition of cooperative games, Research Program in Game Theory and Mathematical Economics, Research Memorandum No. 71, Department of Mathematics, The Hebrew University of Jerusalem, Jerusalem, 1972. (To appear in SIAM J. Appl. Math.)
  • [8] N. Megiddo, Nucleoluses of compound simple games, SIAM J. Appl. Math., 26 (1974).
  • [9] G. Owen, The Tensor Composition of Nonnegative Games, Advances in Game Theory, M. Dresher, L. S. Shapley, and A. W. Tucker, eds., Annals of Mathematics Studies, No.
  • [52] Princeton University Press, Princeton, (1964), 307-327.
  • [10] B. Peleg, The kernel of the composition of characteristic function games, Israel J. Math., 3 (1965), 127-138.
  • [11] L. S. Shapley, Simple Games: An Outline of the Descriptive Theory, Behavioral Science, 7 (1962), 59-66 (also The RAND Corporation, P-2277, April, 1961).
  • [12] L. S. Shapley, Compound Simple Games I: Solutions of Sums and Products, The RAND Corporation, RM-3192, June, 1962.
  • [13] L. S. Shapley, Compound Simple Games II: Some General Composition Theorems, The RAND Corporation, RM-3643, July, 1963.
  • [14] L. S. Shapley,Solu tions of Compound SimpleGames, Advances in Game Theory, M. Dresher, L. S. Shapley, and A. W. Tucker, eds., Annals of Mathematics Studies, No. 52, Princeton University Press, Princeton, (1964), 267-305.
  • [15] L. S. Shapley, Compound Simple Games III: On Committees, The RAND Corporation, RM-5438-PR, October, 1967 (also in "New Methods of Thought and Procedure", ed. by F. Zwycky and A. Wilson, Springer, New York, 1968).