Abstract
In 1966, W. Lucas [1] exhibited a 10 person game with no von Neumann-Morgenstern solution. D. Schmeidler [2] then originated the nucleolus, proved it exists for every game, is unique and is contained in the kernel and the bargaining set (thereby establishing the first elementary proof of their existence). Charnes’ idea of defining solutions by use of uni- or poly-extremal principles involving comparison of coalitional worths and payoffs thereto was specialized by Charnes and Kortanek [3] to non-Archimedean linear programs characterizing and generalizing the nucleolus and to the class of convex nucleus solutions given by minimizing a convex function of the coalitional excesses subject to simple conditions like the payoff vector being a division of the grand coalition value or an imputation.
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
Lucas, W. F. (1968), ‘A game with no solution’, Bull. Am. Math. Soc. 74: 237–239.
Schmeidler, D. (1963), ‘The nucleolus of a characteristic function game’, Research Memorandum 23, Mathematics Dept., The Hebrew University of Jerusalem.
Charnes, A. and Kortanek, K. O. (1970), ‘On classes of convex and preemptive nuclei for n-person games’, in H. W. Kuhn (ed.), Proc. 1967 Princeton Symposium on Mathematical Programming, Princeton, N.J.
Charnes, A. and Keane, M. (1969), ‘Convex nuclei and the shapley value’, Center for Cybernetic Studies Research Report 12, The University of Texas, Austin.
Charnes, A. and Keane, M. (1970), ‘Convex nuclei and the shapley value (abstract)’, Proc. Int. Congress of Mathematicians, Nice.
Seiford, L. (1977), ‘Entropic solutions and disruption solutions for n-person games’, Ph.D. Dissertation Department of Mathematics, University of Texas, Austin.
Gately, D. (1974), ‘Sharing the gains from regional cooperation: a game theoretic application to planning investment in electric power’, Int. Economic Review 15: 195-208.
Littlechild, S. C. and Vaidya, K. G. (1976), ‘The propensity to disrupt and the disruption nucleolus of a characteristic function game’, Int. Jour. Game Theory 5: 151–161.
Charnes, A., Rousseau, J., and Seiford, L. (1977), ‘Complements, mollifiers and the propensity to disrupt’, Int. Jour. Game Theory 7, 37–50.
Michener, H., Yuen, K., and Sakurai, M. (1981), ‘Experimental games’, Int. Jour. Game Theory 10: 75.
Charnes, A. and Golany, B. (1983), ‘Homocores, cores and operational inefficiency in superadditive n-person games’, Int. J. Systems Sci. 14: 877–893.
Charnes, A., Rousseau, J., and Seiford, L. (1982), ‘Mollifiers for games in normal form and the Harsanyi-Selten valuation function’, Int. Jour. Game Theory 11: 163–174.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Martinus Nijhoff Publishers, Dordrecht
About this chapter
Cite this chapter
Charnes, A., Golany, B., Keane, M., Rousseau, J. (1988). Extremal Principle Solutions of Games in Characteristic Function Form: Core, Chebychev and Shapley Value Generalizations. In: Sengupta, J.K., Kadekodi, G.K. (eds) Econometrics of Planning and Efficiency. Advanced Studies in Theoretical and Applied Econometrics, vol 11. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-3677-5_7
Download citation
DOI: https://doi.org/10.1007/978-94-009-3677-5_7
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-8146-7
Online ISBN: 978-94-009-3677-5
eBook Packages: Springer Book Archive