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: (a) the assignment game is generalized to a market game; (b) the two distinguished core points found for the assignment game are also shown to exist for the market game; (c) in the non dual degenerate case it is shown that the skeletons of the buyer and seller cores are isomorphic k-graphs; and (d) 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
bradley,G.H.G.G.brown,and G.W. Graves :Design and Implementation of Large Scale Primal Transshipment Algorithms, Management Science 24 (1977), 1–34.
]Charnes,A.and W.W.Cooper: Management Models and Industrial Applications of Linear Programming, Vols. I and II, John Wiley and Sons, New York, 1961.
]Charnes,A.and D.Klingman: More for Less Paradox in the Distribution Model. Cahiers de Centre des Etudes Operationelle, 13 ( 1971, 11–22.
]Dantzig,G.B: Linear Programming and Extensions, Princeton University Press, Princeton, N.J., 1963.
]Glover,F.,D.Karney,D.Klingman,and A Napier: A Computational Study on Start Procedures, Basis Change Criteria and Solution Algorithms for Transportation Problems. Management Science 20 (1974), 793–813.
]Orden,A: The Transshipment Problem. Management Science 2 (1956), 276–285.
]Shapely,L,S,and,M.Shubik: The Assignment Game I: The Core. International Journal of Game Theory 1 (1972), 111–130.
]Srinivasan,V.and G.L.Thompson: An Operator Theory of Parametric Programming for the Transportation Problem, I and II. Naval Research Logistics Quarterly 19 (1972), 205–252.
Srinivasan,V.and G.L.Thompson:Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm. Journal of the Association for Computing Machinery 20 (1973), 194–213.
Srinivasan,V.and G.L.Thomposon:Cost Operator Algorithms for the Transportation Problem. Mathematical Progranmiing 12 (1977), 372–391.
Thompson,G.L.: Pareto Optimal, Multiple Deterministic Models for Bid and Offer Auctions. In Preparation.
Szwarc, W.: The Transportation Paradox. Naval Research Logistics Quarterly 18 (1971), 185–202.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thompson, G.L. (1980). Computing the Core of a Market Game. In: Fiacco, A.V., Kortanek, K.O. (eds) Extremal Methods and Systems Analysis. Lecture Notes in Economics and Mathematical Systems, vol 174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46414-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-46414-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09730-3
Online ISBN: 978-3-642-46414-0
eBook Packages: Springer Book Archive