×

A new value for games without transferable utilities. (English) Zbl 0282.90064


MSC:

91A35 Decision theory for games
91A12 Cooperative games
Full Text: DOI

References:

[1] Harsanyi, J. C.: Approaches to the bargaining problem before and after the theory of games. Econometrica24, 144–157, 1956. · Zbl 0071.14008 · doi:10.2307/1905748
[2] –: Notes on the bargaining problem. Southern econ. J.XXIV, 471–476, 1958. · doi:10.2307/1055707
[3] –: A bargaining model for the cooperativen-person game. Annals of Mathematics Studies No.40, Princeton, 325–355, 1959. · Zbl 0084.36501
[4] –: A simplified Bargaining Model for then-Person Cooperative Games. International econ. rev.4, 194–220, 1963. · Zbl 0118.15103 · doi:10.2307/2525487
[5] Isbell, J. R.: A Modification of Harsanyi’s Bargaining Model. Bull. of the Am. Math. Soc.66, 70–73, 1960. · Zbl 0092.38202 · doi:10.1090/S0002-9904-1960-10398-9
[6] Miyasawa, K.: Then-Person Bargaining Game. Advances in the theory of Games. Princeton, 547–575, 1964. · Zbl 0124.12303
[7] Nash, J.: The Bargaining Problem. Econometrica18, 155–162, 1950. · Zbl 1202.91122 · doi:10.2307/1907266
[8] Shapley, L. S.: A Value forn-Person Games. Annals of Mathematics Studies, No.28, Princeton, 307–317, 1953. · Zbl 0050.14404
[9] –: Utility Comparison and the Theory of Games. La décision, C.N.R.S. Aix-en-Provence, 251–263, 1967. · Zbl 0166.14601
[10] Wagner, H.: A Unified Treatment of Bargaining Theory. Southern Econ. J.XXIII, 380–397, 1957. · doi:10.2307/1054243
[11] –: Rejoinder on the Bargaining Problem. Southern Econ. J.XXIV, 476–482, 1958. · doi:10.2307/1055708
[12] Zeuthen, F.: Problems of Monopoly and Economic Warfare. London 1930.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.