"Non-cooperative Games" in Annals of Mathematics, Vol. 54, No. 2 (September 1951)<!-- ; as cited in Can and should the Nash program be looked at as a part of mechanism theory? (2003) by Walter Trockel -->
1950s
Context: The writer has developed a “dynamical” approach to the study of cooperative games based upon reduction to non-cooperative form. One proceeds by constructing a model of the preplay negotiation so that the steps of negotiation become moves in a larger non-cooperative game [which will have an infinity of pure strategies] describing the total situation. This larger game is then treated in terms of the theory of this paper [extended to infinite games] and if values are obtained they are taken as the values of the cooperative game. Thus the problem of analyzing a cooperative game becomes the problem of obtaining a suitable, and convincing, non-cooperative model for the negotiation.
The writer has, by such a treatment, obtained values for all finite two-person cooperative games, and some special n-person games.
“The writer has, by such a treatment, obtained values for all finite two-person cooperative games, and some special n-person games.”
"Non-cooperative Games" in Annals of Mathematics, Vol. 54, No. 2 (September 1951)<!-- ; as cited in Can and should the Nash program be looked at as a part of mechanism theory? (2003) by Walter Trockel -->
1950s
Context: The writer has developed a “dynamical” approach to the study of cooperative games based upon reduction to non-cooperative form. One proceeds by constructing a model of the preplay negotiation so that the steps of negotiation become moves in a larger non-cooperative game [which will have an infinity of pure strategies] describing the total situation. This larger game is then treated in terms of the theory of this paper [extended to infinite games] and if values are obtained they are taken as the values of the cooperative game. Thus the problem of analyzing a cooperative game becomes the problem of obtaining a suitable, and convincing, non-cooperative model for the negotiation.
The writer has, by such a treatment, obtained values for all finite two-person cooperative games, and some special n-person games.
Help us to complete the source, original and additional information
John Nash 23
American mathematician and Nobel Prize laureate 1928–2015Related quotes
Improvisation for the Theater 1963), page 4
Source: Finite and Infinite Games: A Vision of Life as Play and Possibility
Source: "Constructivist and ecological rationality in economics," 2002, p. 528.
The Lords and the New Creatures: Poems (1969), The Lords: Notes on Vision
Source: "TGS 09: Keiji Inafune dumps on Tokyo Game Show 2009". https://www.destructoid.com/tgs-09-keiji-inafune-dumps-on-tokyo-game-show-2009-149909.phtmlDestructoid. Retrieved 2017-08-11.
“No wonder I won the games. No decent person ever does.”
Katniss, p. 117
Source: The Hunger Games trilogy, Catching Fire (2009)
"Non-cooperative Games" in Annals of Mathematics, Vol. 54, No. 2 (September 1951)<!-- ; as cited in Can and should the Nash program be looked at as a part of mechanism theory? (2003) by Walter Trockel -->
1950s
Context: We give two independent derivations of our solution of the two-person cooperative game. In the first, the cooperative game is reduced to a non-cooperative game. To do this, one makes the players’ steps of negotiation in the cooperative game become moves in the noncooperative model. Of course, one cannot represent all possible bargaining devices as moves in the non-cooperative game. The negotiation process must be formalized and restricted, but in such a way that each participant is still able to utilize all the essential strengths of his position. The second approach is by the axiomatic method. One states as axioms several properties that it would seem natural for the solution to have and then one discovers that the axioms actually determine the solution uniquely. The two approaches to the problem, via the negotiation model or via the axioms, are complementary; each helps to justify and clarify the other.