Computing the Core of a Market Game.

Abstract

The assignment market game was defined by Shapley in 1955 and received a very full treatment by Shubik and Shapley in 1972. The present paper contains the following extensions: the assignment game is generalized to a market game; the two distinguished core points found for the assignment game are also shown to exist for the market game; in the non dual degenerate case it is shown that the skeletons of the buyer and seller cores are isomorphic k-graphs; and an algorithm is presented for computing skeletons of the buyer and seller cores of a market game. The results are illustrated with examples. At the end some remarks are made on the limiting sizes of cores. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1978
Accession Number
ADA063641

Entities

People

  • Gerald L. Thompson

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Economic Models
  • Economics
  • Linear Programming
  • Mathematics
  • Military Research
  • Optimization
  • Perturbations
  • Skeleton
  • Social Sciences
  • Transportation
  • Universities

Readers

  • Game Theory.
  • Mathematical Modeling and Probability Theory.