{
  "id": "john-forbes-nash",
  "title": "John Forbes Nash Jr.",
  "lang": "en",
  "source_lang": "en",
  "summary": "American mathematician (1928–2015) whose work founded modern non-cooperative game theory, advanced Riemannian geometry and PDEs, and earned the 1994 Nobel Prize in Economic Sciences and the 2015 Abel Prize.",
  "category": "mathematics",
  "subcategory": "applied",
  "type": "person",
  "aliases": [
    "John Forbes Nash",
    "John Nash",
    "Nash equilibrium founder (informal)"
  ],
  "generated_at": "2026-10-16",
  "model": "pro/claude-haiku-5-5",
  "url": "https://aiwiki.page/en/john-forbes-nash/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/john-forbes-nash/",
      "json": "https://aiwiki.page/zh/john-forbes-nash.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "John Forbes Nash Jr. (1928–2015) was an American mathematician whose work changed three fields: game theory, differential geometry, and partial differential equations (PDEs). His 1950 doctoral dissertation at Princeton introduced the Nash equilibrium, a solution concept for strategic situations in which no player can gain by changing strategy alone. The concept became a standard tool in economics, biology, and computer science, and it was cited in the 1994 Nobel Memorial Prize in Economic Sciences, which Nash shared with John Harsanyi and Reinhard Selten.\n\nNash's mathematical reach went well beyond game theory. In the 1950s he proved the Nash embedding theorems, which show that abstract Riemannian manifolds can be embedded isometrically in Euclidean space, and he developed analytic techniques for nonlinear PDEs, including work related to Hilbert's nineteenth problem. These results earned him the 2015 Abel Prize, shared with Louis Nirenberg. Nash is the only person to have received both the Nobel Prize in Economics and the Abel Prize, a fact that reflects how far his influence spread across mathematics and the social sciences.\n\nThis entry first sets out Nash's early life and education and then treats his two main lines of work in game theory: non-cooperative equilibrium and cooperative bargaining. It next covers his geometric and analytic results, his academic career at MIT and Princeton, and his long struggle with schizophrenia, which interrupted his research. The final sections address the Nobel Prize and the spread of game theory, later honors, the cultural image of his life, and the open questions that his concepts still raise."
    },
    {
      "heading": "Early life and education",
      "text": "John Forbes Nash Jr. was born on June 13, 1928, in Bluefield, West Virginia. His father, John Nash, Sr., was an electrical engineer for the Appalachian Power Company, and his mother, Margaret Nash, was a teacher who retired after her marriage and placed a high value on the education of her two children. Biographical accounts describe the family as stable and professionally oriented, and they note that his mother had been a schoolteacher before she married. Nash's interest in technical subjects showed early. As a young man he seemed disinclined to study but displayed a passion for electronics and chemistry experiments that he conducted in his bedroom. While still in high school he attended classes at Bluefield College, and collaborated with his father on a paper titled \"Sag and Tension Calculations for Cable and Wire Spans Using Catenary Formulas,\" which was published in a 1945 edition of Electrical Engineering.\n\nHe entered the Carnegie Institute of Technology in Pittsburgh on a scholarship. That same year, he won a George Westinghouse Scholarship, one of ten awarded nationally. He entered the Carnegie Institute of Technology (now Carnegie-Mellon University) funded by a scholarship and intending to study chemical engineering. His course of study changed several times. Initially aspiring to become an engineer like his father, Nash changed his major to chemistry after performing poorly in mechanical drawing. After he also had trouble with a physical chemistry class, he was convinced by his calculus instructor John Synge to major in mathematics. Shortly after arriving, Nash's mathematical talent was recognised and he was encouraged to become a mathematics specialist. In 1948 Nash graduated with a BA and an MA in mathematics. His former Carnegie professor Richard Duffin supported his graduate applications with a notably brief letter; according to the INFORMS profile, the single sentence read \"This man is a genius.\"\n\nChoice of Princeton\n\nIn the spring of 1948 Nash received several offers. By the spring of 1948, in what would have been his junior year, Nash had been accepted to Harvard, Princeton, Chicago and Michigan University, the top four graduate-level math programs in the U.S. at the time. According to one account drawn from the biography by Sylvia Nasar, Harvard was his first preference for its reputation and faculty, but Nash's mediocre performance on the esteemed Putnam Competition had lead Harvard to offer slightly less money than Princeton. Princeton's mathematics chairman, Solomon Lefschetz, pressed hard for him to come, eventually offering a John S. Kennedy Fellowship of $1,150 per year. Geography also mattered: Princeton's proximity to his family in Bluefield was an additional consideration, according to his Nobel autobiography. He arrived in September 1948, and in September 1948 Nash entered Princeton on the most prestigious Fellowship programme offered by the University.\n\nThe Princeton of 1948 was an unusually concentrated centre of mathematics. Nasar described it as a place where \"Princeton in 1948 was to mathematicians what Paris once was to painters and novelists\". The nearby Institute for Advanced Study also brought scholars to the town, attracting such notable mathematicians as Albert Einstein, Kurt Godel, Karl Oppenheimer, Hermann Weyl, and John von Neumann. Nash's funding moved from the Kennedy fellowship to a government source: Nash was J.S.K. Fellow in Mathematics during 1948–49 and Atomic Energy Commison Pre-Doctoral Fellow during 1949–50.\n\nDoctoral supervision and the department\n\nNash's adviser was Albert W. Tucker, who had close ties to the leading figures of the field. Tucker then returned to Princeton to join the faculty in 1933, where he stayed until 1974. He chaired the mathematics department for about twenty years, one of the longest tenures. Tucker's own circle included collaborators of von Neumann; Nash later recalled that he had been collaborating with von Neumann and Morgenstern. Tucker's doctoral students later included David Gale, John R. Isbell, Marvin Minsky, John Forbes Nash, Torrence Parsons, and Lloyd Shapley.\n\nNash reported that he had more or less found the topic myself and then the thesis advisor was selected by the nature of my topic. His research developed quickly. During his second year as a Princeton graduate student, Nash extended John von Neumann's minimax theorem for two-person zero sum games. Nash completed his doctoral work in two years, receiving his Ph.D. in mathematics a month before his 22nd birthday. The dissertation itself was short: he submitted his 27-page typescript PhD dissertation titled Non-cooperative Games, under the supervision of Albert W Tucker and was awarded his PhD degree in 1950. Its content, which later became the basis of the Nash equilibrium in game theory, is discussed in the following sections."
    },
    {
      "heading": "Non-cooperative games and the Nash equilibrium",
      "text": "Nash's doctoral dissertation, \"Non-Cooperative Games,\" was completed at Princeton in 1950 and published in Annals of Mathematics in 1951. It studies finite games with any number of players, in which each player chooses a strategy independently and no binding agreements are possible. The central concept is an equilibrium point: a profile of strategies from which no player can gain by changing only their own choice.\n\nDefinition for finite n-person games\n\nConsider \\(n\\) players, where player \\(i\\) has a finite set of pure strategies \\(S_i\\) and a payoff function \\(u_i\\) defined on the product \\(S = S_1 \\times \\cdots \\times S_n\\). A mixed strategy for player \\(i\\) is a probability distribution \\(\\sigma_i\\) over \\(S_i\\). The payoff to a profile of mixed strategies is the expected value of \\(u_i\\) under the product distribution:\n\n\\[u_i(\\sigma) = \\sum_{s \\in S} \\Big(\\prod_{j=1}^{n} \\sigma_j(s_j)\\Big)\\, u_i(s)\\]\n\nThis expression is linear in each player's own mixture. A profile \\(\\sigma^* = (\\sigma_1^*, \\dots, \\sigma_n^*)\\) is an equilibrium point when, for every player \\(i\\) and every alternative mixed strategy \\(\\tau_i\\),\n\n\\[u_i(\\sigma^*) \\ge u_i(\\tau_i, \\sigma^*_{-i})\\]\n\nwhere \\(\\sigma^*_{-i}\\) denotes the strategies of all other players. Equivalently, each player's equilibrium strategy is a best response to the others' equilibrium strategies.\n\nWhy mixed strategies are needed, and the existence argument\n\nMany games have no equilibrium in pure strategies. In matching pennies, one player wins if the coins match and the other wins if they differ; any pure choice can be exploited, so no pure profile is stable. If both players randomize with probability one-half on each side, neither can improve, which is the equilibrium. Nash's key result was that every finite game has at least one equilibrium once mixed strategies are allowed.\n\nThe proof works with the best-response correspondence. For each player, \\(B_i(\\sigma_{-i})\\) is the set of mixed strategies that maximize \\(u_i\\) against the others' mixtures. Because payoffs are linear in each player's own mixture, these sets are nonempty and convex, and the correspondence has a closed graph. The product of these correspondences maps the compact convex set \\(\\prod_i \\Sigma_i\\) of all mixed profiles into subsets of itself. A fixed point of this map is exactly an equilibrium. Nash's 1950 note in the Proceedings of the National Academy of Sciences, \"Equilibrium Points in n-Person Games,\" stated the definition and this existence result in a few pages, invoking Kakutani's fixed-point theorem. The dissertation gave a more detailed treatment.\n\nDistinction from von Neumann and Morgenstern\n\nIn Theory of Games and Economic Behavior (1944), John von Neumann and Oskar Morgenstern proved the minimax theorem for two-person zero-sum games, where one player's gain is exactly the other's loss. In that setting, the minimax solution coincides with what Nash's definition would give. Nash's concept, however, does not require zero-sum payoffs, does not restrict the number of players to two, and does not assume strictly opposed interests. Its justification is individual incentive stability rather than a maxmin argument based on pure antagonism. Von Neumann and Morgenstern's own treatment of \\(n\\)-person games used a different solution concept, the stable set, so the equilibrium definition was a genuinely new tool for general-sum interaction.\n\nInterpretation as a self-enforcing outcome\n\nNash's equilibrium is best understood as a self-enforcing outcome: once players settle on it, no one has a unilateral reason to deviate. The concept does not claim that rational players will necessarily reach an equilibrium, nor that it is the best outcome for everyone. The prisoner's dilemma illustrates the gap. Mutual cooperation would leave both players better off than mutual defection, but defection is each player's best reply to the other's, so mutual defection is the unique equilibrium and is not self-enforcing in the sense of joint benefit. The dissertation also discussed a mass-action interpretation, in which equilibrium describes the stable distribution of behavior in a large population of players, a reading that later became central to evolutionary approaches."
    },
    {
      "heading": "Cooperative games and the Nash bargaining solution",
      "text": "Game theory separates strategic settings by whether players can make binding commitments. In a cooperative game, binding agreements are possible, so the analysis concerns which groups of players can jointly commit and how the gains are divided. In a non-cooperative game, no such commitments exist, and the analysis instead asks what each individual will do given the others' choices. Nash's 1950 paper \"The Bargaining Problem\" opened the cooperative side in the axiomatic style. Unlike von Neumann's two-person zero-sum contests, a bargaining situation can offer benefits to both sides, and the cooperative goal is for everyone to do as well as possible without necessarily coming at others' expense.\n\nThe 1950 model is a two-person bargaining problem. The players face a set of feasible agreements, each giving a pair of utilities, and a disagreement point that is the payoff pair they receive if talks fail. Nash specified a class of conflict situations of this type and defined a \"bargaining solution\" as a function that produces an outcome for each problem. Nash then imposed four axioms. Invariance to affine transformations means that the outcome does not depend on how each player's utility is scaled or shifted, which makes the axioms independent of the particular utility representation. Symmetry requires that two players who are identical in their situation receive equal treatment. Pareto efficiency rules out any feasible agreement that would leave both players at least as well off and one strictly better off, and independence of irrelevant alternatives says that if the solution remains feasible in a smaller problem, removing other options should not change it. Under these conditions there is a unique solution, the outcome that maximizes the product of the players' utilities. Measured from the disagreement point, the solution is the point satisfying\n\n\\[\\max_{(u_1,u_2)\\in S,\\; u\\ge d} \\,(u_1-d_1)(u_2-d_2)\\]\n\nwhere \\(S\\) is the feasible set and \\(d=(d_1,d_2)\\) is the disagreement point. The product form means that the solution gives each side a gain that is weighted against the other side's gain, so neither player can be pushed to near zero without the other losing out on the surplus.\n\nNash's 1953 paper, \"Two-Person Cooperative Games,\" introduced what is now called the Nash program. The program attempts to bridge the gap between cooperative and non-cooperative game theory by investigating non-cooperative procedures whose equilibrium outcomes are cooperative solutions. To make this concrete, Nash modeled bargaining as a demand game. Each bargainer makes a simultaneous, once-and-for-all demand expressed as a utility, and if the demands are jointly feasible, bargaining ends with a binding agreement giving those utilities; otherwise the process ends in disagreement. This game has infinitely many Nash equilibria, so the question becomes which equilibria correspond to the axiomatic solution. Nash showed that as the risk of disagreement in the model is made vanishingly small, equilibrium payoffs approach the bargaining solution. The result is often described as a non-cooperative foundation for the cooperative solution, which gives the axioms a strategic justification. Nash himself noted that the negotiation process has to be formalized and restricted to make the model tractable, and it must still allow each participant to use the essential strength of his position.\n\nThe bargaining solution became a standard tool in economics. It has long been the workhorse model for analyzing bilateral labor market transactions in which both parties enjoy some power to influence the terms of exchange. The asymmetric version of the model, which adds weights for each party's relative bargaining power, is especially used for negotiations between firms and workers. The weights, however, raise interpretive questions. The theory does not specify how relative bargaining power is determined, and it is unclear whether threat points represent autarkic payoffs after a failed agreement or chosen outside market opportunities. In negotiation theory, the axiomatic approach is often used as a normative benchmark. An impartial arbitrator could use the solution to identify a fair compromise to recommend to the parties. The standard example is a dispute between management and workers, where disagreement results in a strike, an outcome that is costly to both sides.\n\nFor the division of surplus, the model gives a precise answer to how a jointly created gain should be shared. Given the axioms, the split is determined by the feasible set and the disagreement point, without requiring either side to be able to coerce the other. Applications then reach to pricing, contract design, and the analysis of joint ventures, where the disagreement point is taken to reflect each party's outside options. Ongoing work continues to examine which axioms are essential and how the solution behaves under alternative assumptions about efficiency and invariance."
    },
    {
      "heading": "Riemannian geometry and the Nash embedding theorems",
      "text": "The isometric embedding problem\n\nA Riemannian manifold is a space equipped with a rule for measuring lengths of tangent vectors and curves. The question of whether such an intrinsically defined space can sit inside a Euclidean space without changing those lengths was first stated explicitly by Schläfli in the nineteenth century. An embedding that preserves the length of every curve is called isometric. Bending a sheet of paper without stretching or tearing it is the everyday picture: curves drawn on the sheet keep their arc lengths. Before Nash, the working assumption was that the smoothness demanded of such embeddings was a technical convenience. Rigidity results, notably those of Cohn-Vossen and Herglotz, showed that sufficiently smooth (C²) isometric embeddings of surfaces are essentially determined by their geometry, which made the problem look hard to satisfy in a flexible way.\n\nThe 1954 C¹ theorem\n\nIn a very short 1954 paper, Nash showed that the only real obstructions to isometric immersions are topological. For an \\(n\\)-dimensional manifold, once the target Euclidean space has enough extra dimensions and no topological barrier exists, there are in fact many isometric maps. Nash's original argument required a target of dimension \\(n+2\\); Nicolaas Kuiper, in 1955, reduced the codimension to one. The construction can be described in outline. One first shrinks the manifold, for instance by fitting a sphere into a tiny ball, so that all distances are too small. Then one repeatedly adds microscopic corrugations (\"wrinkles\") that lengthen curves back to their intrinsic values while keeping the map uniformly close to the previous stage. The limit map is only \\(C^1\\), but it is exactly isometric. The result surprised geometers because it showed that the very low regularity of \\(C^1\\) maps supplies enough freedom to meet the metric constraint, a flexibility that disappears at \\(C^2\\).\n\nThe 1956 smooth theorem\n\nThe \\(C^1\\) construction produces maps that are not smooth enough for most purposes, so Nash's 1956 paper treated the \\(C^k\\) (and eventually \\(C^\\infty\\)) case, which was considerably harder. The difficulty is a loss of derivatives. The linearized equations that govern a correction at each step involve one more derivative than the step can control, so a naive iteration does not converge. Nash handled this by inserting smoothing operators (mollifiers) at each stage, which recover the derivatives lost in solving the linear problem, and by controlling the error with a carefully chosen nested sequence of estimates. The result was an explicit but large bound on the dimension of the Euclidean space needed for compact manifolds. In 1966 Nash also treated the real-analytic case, and later simplifications were given by Greene and Jacobowitz.\n\nNash–Moser methods and later developments\n\nThe scheme that Nash devised for the smooth theorem was abstracted in the following years, principally by Jürgen Moser and Lars Hörmander, into an implicit function theorem for problems in which the inverse of the linearized operator loses derivatives, so that the ordinary Banach-space implicit function theorem cannot be applied. This Nash–Moser theorem became a standard tool for proving local existence of solutions to nonlinear partial differential equations in spaces of smooth functions; Moser used it on existence of periodic orbits in celestial mechanics. Later, Matthias Günther gave a simpler proof of the smooth embedding theorem by reducing the nonlinear problem to an elliptic system to which the contraction mapping theorem applies, avoiding the full Nash–Moser machinery.\n\nGromov's broader program grew directly from Nash's ideas. Gromov reformulated the \\(C^1\\) wrinkling argument as a general method, which he called convex integration, and used it to establish the h-principle for a wide class of geometric problems. In 1970 Gromov and Rokhlin, and independently Greene, proved that every smooth \\(d\\)-dimensional Riemannian manifold admits a local smooth isometric embedding into a Euclidean space of a dimension depending only on \\(d\\), following Nash's iteration scheme. Convex integration later became a central technique in fluid dynamics, where it was used to construct non-unique weak solutions to the Euler equations and to resolve Onsager's conjecture on energy conservation in turbulence. In this sense, Nash's embedding theorems opened a line of research in which geometric flexibility is studied across geometry, analysis and mathematical physics."
    },
    {
      "heading": "Partial differential equations and the Nash–De Giorgi theorem",
      "text": "The Nash–Moser inverse function theorem\n\nNash's work on isometric embedding in the mid-1950s led to nonlinear systems in which the linearized equation loses derivatives: solving it returns a function less smooth than the data it was given. The classical implicit-function theorem assumes a bounded loss of smoothness and cannot be applied directly to such problems. Nash overcame this with a Newton-type iteration that includes smoothing operators at each step. Jürgen Moser later isolated the abstract principle behind this technique, which is now called the Nash–Moser theorem. The result showed that nonlinear problems with loss of derivatives can still be solved by iteration with smoothing, and it later became a tool in areas such as KAM theory and Hamiltonian dynamics.\n\nThe 1958 Hölder continuity theorem\n\nEnnio De Giorgi proved in 1957 that weak solutions of elliptic equations are Hölder continuous, and in 1958 Nash reached the same conclusion independently for parabolic equations. Nash's version also yields the elliptic case when the coefficients do not depend on time. The decisive feature of the theorem is that the coefficients need only be bounded, measurable and uniformly elliptic. Earlier regularity theory, rooted in Schauder estimates, required the coefficients themselves to be Hölder continuous. Nash's route differed from De Giorgi's: he studied the fundamental solution of the parabolic operator and derived regularity of general solutions from its properties, establishing upper and lower bounds that are Gaussian-type. Shortly afterwards Jürgen Moser gave a simpler proof based on iteration of powers of the solution, which led to the Harnack inequality and is now usually referred to as the De Giorgi–Nash–Moser theory.\n\nHilbert's nineteenth problem\n\nHilbert's nineteenth problem asked whether minimizers of regular variational integrals must be analytic. The De Giorgi–Nash estimates answered the regularity part of this question in a decisive way: they showed that minimizers are continuous, and indeed Hölder continuous, without any smoothness assumption on the coefficients, which was the first and hardest step toward the full answer. The problem had come to Nash through Louis Nirenberg, then at New York University, who is usually credited with suggesting the topic that led to the 1958 paper.\n\nStandard tools in nonlinear analysis\n\nWithin a few years the results of Nash, De Giorgi and Moser had become standard references in the field. Their estimates are used to study quasilinear equations and to prove existence and regularity for parabolic problems, and they became basic ingredients of partial differential equation theory and of analysis applied to geometric problems. When the Abel Committee later honored Nash and Nirenberg in 2015, it described their breakthroughs as techniques that \"have become essential tools\" for nonlinear partial differential equations, and noted that their impact could be felt in all branches of the theory. The methods of Nash and Nirenberg, which were developed largely in parallel in the 1950s, continue to supply the regularity estimates on which later work relies."
    },
    {
      "heading": "Academic career at MIT and Princeton",
      "text": "Nash's first academic post was at Princeton, where he was appointed a research assistant and instructor in 1950, the year his doctorate was completed. Nash was appointed research assistant and instructor at Princeton in 1950 and worked as a consultant for the Rand Corp. during the summers of 1950 and 1952. The consulting for the RAND Corporation was centred on military uses of game theory. Here he dealt with the military application of game theory. The sources give different durations. RAND's own 2015 statement describes him as a consultant at RAND from 1950 to 1954, while the INFORMS biography lists specific summers, 1950, 1952, and 1954. The INFORMS account also records that he was dismissed in 1954 following his arrest in a police operation, although he kept some channels to RAND open in later years.\n\nIn 1951 Nash moved to the Massachusetts Institute of Technology as a C.L.E. Moore instructor in mathematics. He became an assistant professor in 1953 and was promoted to associate professor in 1957. Sources differ on when he gained tenure: Princeton's alumni memorial says he became an instructor at MIT in 1951, earning a tenured position in 1958. His MIT research moved toward analysis. Britannica notes that he pursued research into partial differential equations, and his \"Real Algebraic Manifolds\" was published in Annals of Mathematics in November 1952. Wikipedia summarises the work of this period as turning to differential geometry, phrased in geometrical language, but almost entirely concerned with the mathematical analysis of partial differential equations. The embedding results from these years are treated in a later section of this entry.\n\nNash's MIT years also involved regular contact with colleagues outside pure mathematics. He regularly interacted with colleagues in the economics department including Paul A. Samuelson and Robert M. Solow. Isadore Singer, who shared an office with Dr. Nash and remembers him as \"brilliant\" and doing \"fundamental work\" in pure mathematics as well as game theory. At Princeton, before his MIT appointment, the environment was similarly collegial. A Princeton contemporary recalled that John, Lloyd, and I were competitive in our research, which John enhanced with practical jokes, and that many of us at Princeton also enjoyed inventing playable games that illustrated points and difficulties in game theory development.\n\nNash's time at MIT ended in 1959. Nash resigned his position at MIT in 1959 after being diagnosed as a paranoid schizophrenic. He was then hospitalised at McLean Hospital, and from 1959 to 1970, Nash moved around to a variety of institutions across the globe, receiving continued care for his condition. During this period from 1960 to 1965, he held a position at Princeton University and with the associated Institute for Advanced Study. Since the mid-1960s, Nash lived in the Princeton area. As a visiting research collaborator in the Mathematics Department, he made use of computing and library facilities in a program of independent research. Titles in the sources vary: Britannica records that he then began an informal association with Princeton, where he became a senior research mathematician in 1995. He remained associated with the university until his death in 2015, when he was killed with his wife, Alicia, May 23, 2015, in a taxi crash on the New Jersey Turnpike."
    },
    {
      "heading": "Schizophrenia and the interruption of research",
      "text": "Nash's illness emerged in 1959, only a short time after he had secured a permanent post. Nash earned a tenured position at MIT in 1958. In his own later account, the first \"mental disturbances\" began in early 1959, while his wife Alicia was pregnant. Early symptoms were mainly suspicion and erratic conduct. According to Alicia, he came to believe that all men who wore red ties were included in a communist conspiracy against him. He also sent letters to embassies in Washington, D.C. to warn of the supposed plot.\n\nThe first hospitalization followed. He was admitted to McLean Hospital in April 1959 and stayed there through May. This is where he was diagnosed with paranoid schizophrenia. Accounts differ on the length of the stay; one biographical source gives 50 days. Nash's position at MIT ended soon after. In the spring of 1959, he resigned his position as a member of the MIT mathematics faculty due to his mental health problems.\n\nThe period that followed was marked by travel and further crises. After his release, he left for Europe, withdrew his pension fund and fled to Europe. He wandered from country to country, attempting to renounce his American citizenship and be declared a refugee. He believed he was a secret messenger of God and the focus of an international communist conspiracy. The State Department later helped return him to the United States at Alicia's request, With help from the State Department, Alicia had him deported back to the U.S. By 1960 he was back at Princeton, and After a problematic stay in Paris and Geneva, Nash returned to Princeton in 1960.\n\nThe 1960s brought repeated involuntary confinement. In 1961, Nash was admitted to the New Jersey State Hospital at Trenton to receive treatment for his paranoid schizophrenia. In a 1994 account, Nash described these stays as non-voluntary and said he repeatedly sought legal grounds for release. He highlighted that he was never admitted on a voluntary basis, and that he was constantly attempting to find legal reasons for him to be released. Personal strain increased as well: illness took its toll and divorce followed in 1963, with various hospitalizations until 1970.\n\nRecovery was slow and uneven. After 1970, his condition slowly improved, allowing him to return to academic work by the mid-1980s. The turning point in his living situation came when after his mother's death in 1970, Nash returned to Princeton, where he became known as the \"Phantom of Fine Hall,\" the mathematics building. Alicia also took him back into her home. Even though he and his wife divorced in 1963, she took him in to live with her after his final hospital discharge in 1970. Improvement did not progress in a straight line. The Guardian obituary notes gradual recovery after many severe episodes in the 1970s, 80s and early 90s, and his mathematical contributions continued in the gaps between hospitalizations. Some popular accounts state that he stopped taking medication completely in the 1970s, and he was never again committed to a hospital. Sources vary on when his formal return occurred: one notes that he returned to Princeton in 1995 as a researcher.\n\nThe effect on his research output was substantial. Nash's work in the late 1950s had been among the most promising in his field, and the years that followed produced far less. Nash did not publish extensively, although many of his papers are considered landmarks in their fields. His illness is also a central theme in public accounts of his life. Nash's life was the subject of Sylvia Nasar's 1998 biographical book A Beautiful Mind, and his struggles with his illness and his recovery became the basis for a 2001 film of the same name directed by Ron Howard, in which Nash was portrayed by Russell Crowe. Readers should note that the biography and film differ in detail from the documentary record, and that the specific dates above come from different sources that do not always agree."
    },
    {
      "heading": "The 1994 Nobel Prize and the spread of game theory",
      "text": "The award and what it recognized\n\nIn 1994 the Sveriges Riksbank Prize in Economic Sciences in Memory of Alfred Nobel went jointly to Nash, John C. Harsanyi and Reinhard Selten, with the citation praising their \"pioneering analysis of equilibria in the theory of non-cooperative games.\" It was the first time the committee honoured game theory, a field that von Neumann and Morgenstern had launched in 1944 and that had become a mainstay of economic analysis by the early 1990s.\n\nThe three laureates each extended the equilibrium idea in a different direction, and the committee's shared focus lay in that common thread. Nash supplied the equilibrium concept for finite non-cooperative games, in which every player's strategy is a best reply to the others. Selten, in 1965, introduced subgame perfection, a refinement that removes equilibria relying on non-credible threats in multi-stage games. Harsanyi, who had been inspired by Nash's early-1950s work, relaxed the assumption that each player knows the others' preferences, treating every player as one of several possible \"types.\" The committee's background material stressed that economic questions such as oligopoly pricing arise in non-cooperative settings, because firms cannot sign binding contracts that restrict competition.\n\nKuhn's advocacy and the committee's deliberations\n\nHarold Kuhn, a Princeton colleague and longtime friend of Nash, was central to the award. Kuhn had edited Nash's papers and was credited with being instrumental in securing the prize. Nash's nomination was backed by a group of supporters that included Kuhn. In 1994 the Nobel committee invited Kuhn to chair a panel discussion on Nash's work, and Kuhn also convened a special seminar on that work in connection with the Stockholm ceremonies.\n\nNash's health was a delicate question for the committee. By the early 1990s, when the committee began considering him, his illness had subsided. Kuhn and other colleagues helped persuade the committee that Nash was well enough to accept the prize, and they defended the choice when some questioned honouring a man who had suffered from a serious mental disorder. Nash reportedly learned of the award by a telephone call from the Nobel Foundation's secretary general on the morning after the decision. He delivered his Nobel seminar in Stockholm on 8 December 1994.\n\nAdoption in economics\n\nBy 1994, game-theoretic models were already widely used. The academy's own material noted that a substantial share of papers in economic theory relied on them, by one estimate at least a quarter. The impact was most visible in industrial organization. The emphasis on multi-stage games between oligopolistic firms in modern industrial organization would be hard to imagine without the concept of subgame perfection, which Selten introduced after experimental studies of oligopoly behaviour.\n\nAuction design offers a concrete example of practical use. Around the time of the prize, the US Federal Communications Commission relied on game-theoretic analysis to design a roughly $7 billion auction of radio spectrum for personal communication services, and bidders used the same tools to plan their strategies. In macroeconomics, Selten's work informed the analysis of the time-consistency problem in public policy, and the Nobel citation for Finn Kydland and Edward Prescott explicitly acknowledged that debt.\n\nSpread into biology, political science and computer science\n\nGame theory migrated well beyond economics in the years after 1994. In evolutionary biology, the 1973 formalism of John Maynard Smith and George Price, built on the evolutionarily stable strategy, was quickly adopted and became a central tool for explaining animal and plant interaction. The stable strategy concept was later shown to be a special case of a Nash equilibrium, and Nash's own mass-action interpretation of mixed equilibria, which fits biology naturally, had been largely absent from his dissertation and from textbooks.\n\nIn political science, game-theoretic models became standard in courses across the social sciences; by the early 2000s the theory was taught in departments of mathematics, economics, biology, political science, psychology and sociology alike. Political theorists used its mathematics to analyse democratic institutions and voting, while the Cold War-era debates about rationality had already helped carry the theory into these fields. In computer science, researchers applied game-theoretic models to artificial intelligence and to cybernetics, and the same ideas later shaped work on algorithm design and multi-agent systems.\n\nThe prize also drew public attention to the theory itself. Because the Nash equilibrium is still the most widely used solution concept in game theory, the recognition in 1994 reinforced its role as a common language across disciplines. Its limits, including multiple equilibria and the refinements developed to address them, are discussed in a later section."
    },
    {
      "heading": "Later honors and the Abel Prize",
      "text": "In 1978 the Institute for Operations Research and the Management Sciences awarded its John von Neumann Theory Prize jointly to Nash and Carlton Lemke. The shared award was seen as fitting, because both men had been major contributors to the theory of non-cooperative games, which the same account describes as the principal extension of von Neumann's original idea. One INFORMS biography adds that the prize was presented by the Operations Research Society of America, a predecessor body, and credits the work with opening a new chapter in the theory and practice of games and mathematical programming. Lemke's contribution was closely tied to Nash's: Nash's contributions were solidified when Carlton Lemke and J. T. Howson, Jr devised an ingenious algorithm for the bimatrix case.\n\nIn 1996 Nash was elected to the United States National Academy of Sciences. This was one of several recognitions that followed his Nobel Prize in economics, which he had shared in 1994 for his work on equilibria in non-cooperative games.\n\nThe 2015 Abel Prize came later and rested on a different body of work. On 25 March 2015 the Norwegian Academy of Science and Letters announced that Nash would share the award with Louis Nirenberg of New York University's Courant Institute. The prize citation recognized Nash and Nirenberg for \"striking and seminal contributions\" to the theory of nonlinear partial differential equations and their applications to geometric analysis. The Academy also described the impact of their results in strong terms: their breakthroughs have developed into versatile and robust techniques that have become essential tools for the study of nonlinear partial differential equations. The prize itself is given to work of exceptional depth and influence in the mathematical sciences, and the 2015 award carried a cash sum of about US$750,000 according to the Abel Prize's own report, although Princeton's news office gave the figure as $800,000. The two laureates received the award from King Harald V of Norway at a ceremony in Oslo on 19 May 2015.\n\nThe Academy's citation placed particular weight on Nash's geometric work. Nash's work in geometry and partial differential equations is regarded by the mathematical community as his \"most important and deepest work,\" according to the academy. The central result was the embedding theory discussed elsewhere in this entry. Isometric embedding theorems, showing the possibility of realizing an intrinsic geometry as a submanifold of Euclidean space, have motivated some of these developments. The smooth version of the theorem is the one most often cited today, and the Academy noted that by proving that any Riemannian geometry can be smoothly realized as a submanifold of Euclidean space, Nash's smooth theorem establishes the equivalence of Riemann's intrinsic point of view with an extrinsic one. The companion nonsmooth result, which was improved by Kuiper, showed that embeddings which at first seemed forbidden by geometric invariants such as Gauss curvature are in fact possible, and it became central to Gromov's theory of convex integration.\n\nNash died on 23 May 2015, four days after the Oslo ceremony. Nash is the first Nobel laureate to have won the Abel prize but not the first prize winner to have made contributions to Game Theory. A commentary on his career goes further and states that John Nash is the only person to be awarded both Abel as well as Nobel Prize; this is a secondary account, but it matches the usual description of his distinction as the only laureate of both prizes."
    },
    {
      "heading": "Cultural image, legacy, and open questions",
      "text": "Biography and film\n\nSylvia Nasar's 1998 biography, published by Simon & Schuster, gave the public its most detailed narrative of Nash's life, including his breakdown and long recovery. The book won the National Book Critics Circle Award for biography, and it was also a Pulitzer Prize finalist. The 2001 film was directed by Ron Howard and based on a screenplay by Akiva Goldsman, who adapted the 1998 biography by Sylvia Nasar. Russell Crowe played Nash. The film received generally positive reviews and won four Academy Awards, for Best Picture, Best Director, Best Adapted Screenplay and Best Supporting Actress (Connelly).\n\nThe film departs from the book in several ways. Compared with the book, it concentrates on Nash's mental health and on how his condition affected the people around him, especially his family. It also includes fictionalized characters and episodes, most notably a composite intelligence figure. For many viewers, the screen version therefore became the main image of Nash, and it framed his mathematics mainly through his illness. The film's success made the figure of the mathematical genius widely recognized, but it also left a persistent public impression that the work itself was harder to appreciate than the drama of the life.\n\nLimits of the equilibrium concept\n\nThe Nash equilibrium is a consistency condition, not a unique prediction. A game may have several equilibria, and some of them rest on implausible behavior. Reinhard Selten addressed this in two steps. His subgame perfection concept, introduced in 1965, removes threats that are not credible in later stages of an extensive-form game. In 1975 he proposed trembling-hand perfection, which asks whether an equilibrium survives when players might make small mistakes. Its rationale is to let players reason about the possibility that they may make mistakes in the future, playing sub-optimal actions with small, vanishing probabilities. A standard example is a \\(2\\times 2\\) game with two equilibria in which only one of the two is a perfect equilibrium. Selten also showed that a game in which every player has a single information set can still contain equilibria that look unreasonable; this example became known as Selten's Horse. Equilibrium selection, which asks which equilibrium players will actually reach, remains a separate question that these refinements only partly answer.\n\nExperiments test these refinements with mixed results. A 2022 study of the three-player Selten's Horse game found that the data show little support for the trembling-hand perfect equilibrium at first sight, and rather favor the imperfect equilibrium. Over longer horizons, the authors report that the behavior moves closer to the refinement, but not in a simple way.\n\nComputational complexity\n\nNash's existence theorem says that every finite game has an equilibrium, but it does not say how to find one efficiently. The credibility of the Nash equilibrium as a framework for behavior prediction depends on whether such equilibria are efficiently computable, since it is unclear why rational agents should behave in a way that requires exponential time to compute. Research in the late 2000s answered this in a negative direction. The computation of an equilibrium was shown to be complete for the class PPAD, which stands for Polynomial Parity Argument in Directed graphs. The problem of computing a Nash equilibrium in a game with 4 or more players is complete for the complexity class PPAD. Later work extended this to two-player games: computing a Nash equilibrium of a bimatrix game is PPAD-complete, which is attributed to Chen and Deng. The practical consequence is that, unless PPAD equals FP, no efficient general algorithm is expected, so the equilibrium is not always accessible in practice. This has pushed researchers toward approximate equilibria, but even computing a relatively approximate Nash equilibrium in two-player games is PPAD-complete, even for constant values of the approximation.\n\nContinuing research\n\nSeveral research programs remain active. The Nash bargaining solution continues to be studied in economic theory and applied negotiation models, and the isometric embedding and rigidity problems of Riemannian geometry remain areas of geometric analysis. A further line concerns learning and artificial intelligence. Because the Nash equilibrium has several weaknesses when played against opponents with bounded rationality who may make mistakes, researchers in artificial intelligence and computer science study learning dynamics, multi-agent systems and algorithms that aim for refined equilibria rather than arbitrary ones. Game theory thus connects to the PPAD complexity questions above, to questions of trembling-hand perfection, and to the broader problem of how strategic agents, human or artificial, can reach stable outcomes."
    }
  ],
  "links": [
    "nash-equilibrium",
    "economics",
    "biology",
    "computer-science",
    "nobel-memorial-prize-in-economic-sciences",
    "mathematics",
    "massachusetts-institute-of-technology",
    "princeton-university",
    "schizophrenia",
    "game-theory",
    "differential-geometry",
    "manifold",
    "euclidean-space",
    "partial-differential-equation",
    "david-hilbert",
    "mathematical-analysis",
    "rand-corporation",
    "john-von-neumann",
    "nobel-prize",
    "artificial-intelligence"
  ],
  "sources": [
    {
      "title": "John Forbes Nash Jr",
      "url": "https://www.encyclopedia.com/people/science-and-technology/mathematics-biographies/john-forbes-nash-jr"
    },
    {
      "title": "John Forbes Nash, Jr. - Infogalactic: the planetary knowledge core",
      "url": "https://infogalactic.com/info/John_Forbes_Nash,_Jr."
    },
    {
      "title": "The Beautiful Life of John Forbes Nash, Jr.",
      "url": "https://shockfilmfest.com/education/the-beautiful-life-of-john-forbes-nash-jr/"
    },
    {
      "title": "John Forbes Nash, Jr.",
      "url": "https://www.romeconomics.com/john-forbes-nash-jr-1928/"
    },
    {
      "title": "Nash, Jr., John F. - INFORMS",
      "url": "https://www.informs.org/Explore/History-of-O.R.-Excellence/Biographical-Profiles/Nash-Jr.-John-F"
    },
    {
      "title": "769 ARTICLE-IN-A-BOX RESONANCE September 2016 The Creative Genius: John Nash",
      "url": "https://www.ias.ac.in/public/Volumes/reso/021/09/0769-0772.pdf"
    },
    {
      "title": "Albert W. Tucker",
      "url": "https://en.wikipedia.org/wiki/Albert_W._Tucker"
    },
    {
      "title": "Interview with Abel Laureate John F. Nash Jr.",
      "url": "https://www.ams.org/journals/notices/201605/rnoti-p486.pdf"
    },
    {
      "title": "John Forbes Nash, Jr. - Princeton Graduate School",
      "url": "https://gradschool.princeton.edu/deans-initiatives-awards-events/dean%E2%80%99s-initiatives/viget-honor-roll/john-forbes-nash-jr"
    },
    {
      "title": "The Bargaining Problem, Econometrica, Vol. 18, No. 2, April 1950, pp. 155-162 [GAME THEORY, ORIGINAL WRAPPERS] by Nash, John",
      "url": "https://www.biblio.com/book/bargaining-problem-econometrica-vol-18-2/d/823390945"
    },
    {
      "title": "Bargaining and the theory of cooperative games: John Nash and beyond",
      "url": "https://rcer.econ.rochester.edu/RCERPAPERS/rcer_554.pdf"
    },
    {
      "title": "Nash Bargaining: The Math of Negotiation",
      "url": "https://www.kipuhub.com/en/article/nash-bargaining/"
    },
    {
      "title": "Serrano, Roberto Working Paper Fifty years of the Nash program, 1953 - 2003",
      "url": "https://www.econstor.eu/bitstream/10419/80190/1/481979417.pdf"
    },
    {
      "title": "john nash and the analysis of strategic behavior by vincent p ...",
      "url": "https://econweb.ucsd.edu/~vcrawfor/2000-03.pdf"
    },
    {
      "title": "NASH EQUILIBRIUM AND THE HISTORY OF ECONOMIC THEORY by Roger B. Myerson",
      "url": "https://home.uchicago.edu/rmyerson/research/jelnash.pdf"
    },
    {
      "title": "Wesleyan Economic Working Papers http://repec.wesleyan.edu/ No: 2020-005",
      "url": "http://repec.wesleyan.edu/pdf/gskillman/2020005_skillman.pdf"
    },
    {
      "title": "Game Theory Bargaining Theory Jordi Massó",
      "url": "http://pareto.uab.es/jmasso/pdf/Bargaining%20Handout.pdf"
    },
    {
      "title": "Asymmetric Nash bargaining solutions: A simple Nash program - ScienceDirect",
      "url": "https://www.sciencedirect.com/science/article/abs/pii/S0165176513001973"
    },
    {
      "title": "Nash embedding theorems",
      "url": "https://en.wikipedia.org/wiki/Nash_embedding_theorems"
    },
    {
      "title": "JOHN NASH’S NONLINEAR ITERATION CAMILLO DE LELLIS AND L´ASZL´O SZ´EKELYHIDI JR.",
      "url": "https://www.math.ias.edu/delellis/sites/math.ias.edu.delellis/files/contr_vol_Nash_11.pdf"
    },
    {
      "title": "THE NASH–KUIPER THEOREM AND THE ONSAGER CONJECTURE CAMILLO DE LELLIS",
      "url": "https://www.math.ias.edu/delellis/sites/math.ias.edu.delellis/files/Bejing-5.pdf"
    },
    {
      "title": "Geometric, algebraic, and analytic descendants of Nash ...",
      "url": "https://www.ams.org/bull/2017-54-02/S0273-0979-2016-01551-5/S0273-0979-2016-01551-5.pdf"
    },
    {
      "title": "A Brief History",
      "url": "https://www.ams.org/bookstore/pspdf/surv-130-prev.pdf"
    },
    {
      "title": "Isometric immersions and applications",
      "url": "https://arxiv.org/pdf/2310.02566"
    },
    {
      "title": "NOTES ON THE ISOMETRIC EMBEDDING PROBLEM AND THE NASH-MOSER IMPLICIT FUNCTION",
      "url": "https://maths.anu.edu.au/files/CMAproc40-andrews.pdf"
    },
    {
      "title": "Nash%E2%80%93Moser theorem",
      "url": "https://en.wikipedia.org/wiki/Nash%E2%80%93Moser_theorem"
    },
    {
      "title": "‘The imbedding problem for Riemannian manifolds,’ pp. 20-63 in Annals of Mathematics, Vol. 63, No. 1 by John NASH on SOPHIA RARE BOOKS",
      "url": "https://www.sophiararebooks.com/pages/books/6059/john-nash/the-imbedding-problem-for-riemannian-manifolds-pp-20-63-in-annals-of-mathematics-vol-63-no-1"
    },
    {
      "title": "Nash embedding theorem",
      "url": "https://www.scientificlib.com/en/Mathematics/LX/NashEmbeddingTheorem.html"
    },
    {
      "title": "High dimensionality and h-principle in PDE",
      "url": "https://arxiv.org/pdf/1609.03180"
    },
    {
      "title": "Convex Integration in PDEs, Geometry, and Variational Calculus",
      "url": "https://www.birs.ca/workshops/2019/19w5130/report19w5130.pdf"
    },
    {
      "title": "ℎ-principle and rigidity for 𝐶^{1,𝛼} isometric embeddings",
      "url": "https://arxiv.org/html/0905.0370"
    },
    {
      "title": "The De Giorgi-Nash-Moser Estimates We are going to discuss the the equation",
      "url": "https://www.math.stonybrook.edu/~cschnell/pdf/notes/nashmoser.pdf"
    },
    {
      "title": "A New Proof of Moser’s Parabolic Harnack Inequality Using the old Ideas of Nash",
      "url": "https://link.springer.com/chapter/10.1007/978-3-642-83743-2_24"
    },
    {
      "title": "Geometric De Giorgi Theory",
      "url": "https://arxiv.org/pdf/2308.04271"
    },
    {
      "title": "Harnack, Holder, Gauss and Widder: Serrin's Parabolic Legacy",
      "url": "https://arxiv.org/pdf/1611.09417"
    },
    {
      "title": "Nash and Nirenberg Awarded 2015 Abel Prize",
      "url": "https://www.ams.org/notices/201506/rnoti-p670.pdf"
    },
    {
      "title": "2015 Abel Prize Winners Announced - IMA",
      "url": "https://ima.org.uk/111/2015-abel-prize-winners-announced/"
    },
    {
      "title": "A 'long awaited recognition': Nash receives Abel Prize for revered work in mathematics",
      "url": "https://www.princeton.edu/news/2015/03/26/long-awaited-recognition-nash-receives-abel-prize-revered-work-mathematics"
    },
    {
      "title": "12. John Forbes Nash Jr. *50",
      "url": "https://www.princetonianamuseum.org/artifact/84d534d4-ccdc-408b-9bd1-876563c10878"
    },
    {
      "title": "Statement About John Forbes Nash, Jr.",
      "url": "https://www.rand.org/news/press/2015/05/24.html"
    },
    {
      "title": "nash 1019",
      "url": "https://news.mit.edu/1994/nash-1019"
    },
    {
      "title": "John F. Nash Jr. *50",
      "url": "https://paw.princeton.edu/memorial/john-f-nash-jr-50"
    },
    {
      "title": "John Nash",
      "url": "https://www.britannica.com/biography/John-Nash"
    },
    {
      "title": "John Forbes Nash Jr.",
      "url": "https://en.wikipedia.org/wiki/John_Forbes_Nash_Jr."
    },
    {
      "title": "John Forbes Nash Jr. (1928–2015)",
      "url": "https://www.science.org/doi/10.1126/science.aac7085"
    },
    {
      "title": "Personal life of John Nash - A Beautiful Mind",
      "url": "https://www.abeautifulmind.com/personal-life-of-john-nash/"
    },
    {
      "title": "John Forbes Nash Jr. mental health - A Beautiful Mind",
      "url": "https://www.abeautifulmind.com/john-forbes-nash-jr-mental-health/"
    },
    {
      "title": "Watch A Brilliant Madness",
      "url": "https://www.pbs.org/wgbh/americanexperience/films/nash/"
    },
    {
      "title": "John Forbes Nash",
      "url": "https://www.intervoiceonline.org/2483/blog/news/john-forbes-nash.html"
    },
    {
      "title": "In memoriam: John Nash — Adam Smith Institute",
      "url": "https://www.adamsmith.org/blog/uncategorized/in-memoriam-john-nash"
    },
    {
      "title": "John Nash - Guardian obituary - MacTutor History of Mathematics",
      "url": "https://mathshistory.st-andrews.ac.uk/Obituaries/Nash_Guardian/"
    },
    {
      "title": "John Nash, The Mathematical Genius Whose Battle With Schizophrenia Inspired 'A Beautiful Mind'",
      "url": "https://allthatsinteresting.com/john-nash"
    },
    {
      "title": "John Nash and his Experiences with Schizophrenia",
      "url": "https://lmclark7.com/john-nash-documentary/"
    },
    {
      "title": "John Nash: A Beautiful Mind's Struggle with Schizophrenia",
      "url": "https://www.ourmental.health/stars-struggles/a-beautiful-mind-john-forbes-nashs-battle-with-schizophrenia"
    },
    {
      "title": "John Nash",
      "url": "https://study.com/academy/lesson/john-nash-mathematician-life-career.html"
    },
    {
      "title": "John Forbes Nash",
      "url": "https://www.encyclopedia.com/science/encyclopedias-almanacs-transcripts-and-maps/john-forbes-nash"
    },
    {
      "title": "John F. Nash - Econlib",
      "url": "https://www.econlib.org/library/Enc/bios/Nash.html"
    },
    {
      "title": "Reinhard Selten - Econlib",
      "url": "https://www.econlib.org/library/Enc/bios/Selten.html"
    },
    {
      "title": "John C. Harsanyi - Econlib",
      "url": "https://www.econlib.org/library/Enc/bios/Harsanyi.html"
    },
    {
      "title": "Reinhard Selten: Pioneering analyst of rationality and human behaviour",
      "url": "https://cepr.org/voxeu/columns/reinhard-selten-pioneering-analyst-rationality-and-human-behaviour"
    },
    {
      "title": "Game Theory - Topic",
      "url": "https://mediatheque.lindau-nobel.org/topics/game-theory"
    },
    {
      "title": "Game Theory (Open Access textbook with 165 solved exercises)",
      "url": "https://arxiv.org/pdf/1512.06808"
    },
    {
      "title": "On Sparse Discretization for Graphical Games",
      "url": "https://arxiv.org/pdf/1411.3320"
    },
    {
      "title": "John C. Harsanyi - Obituary by Bernhard von Stengel",
      "url": "http://www.maths.lse.ac.uk/personal/stengel/Gametheory/harsanyi.html"
    },
    {
      "title": "Professor John Harsanyi",
      "url": "https://www.anu.edu.au/about/awards-achievements/research-achievements/professor-john-harsanyi"
    },
    {
      "title": "John F. Nash Jr., Math Genius Defined by a ‘Beautiful Mind,’ Dies at 86",
      "url": "https://www.colorado.edu/amath/news/john-f-nash-jr-math-genius-defined-beautiful-mind-dies-86"
    },
    {
      "title": "In Memoriam: Harold W. Kuhn (1925-2014) - INFORMS",
      "url": "https://www.informs.org/ORMS-Today/Public-Articles/August-Volume-41-Number-4/In-Memoriam-Harold-W.-Kuhn-1925-2014"
    },
    {
      "title": "John Forbes Nash, Jr., 1928–2015",
      "url": "https://www.ias.edu/ideas/2015/john-forbes-nash-jr"
    },
    {
      "title": "Obituaries: Harold Kuhn (1925-2014)",
      "url": "https://www.siam.org/publications/siam-news/articles/obituaries-harold-kuhn-1925-2014/"
    },
    {
      "title": "The early rise and spread of evolutionary game theory: perspectives based on recollections of early workers",
      "url": "https://royalsocietypublishing.org/doi/10.1098/rstb.2021.0493"
    },
    {
      "title": "Read \"A Beautiful Math: John Nash, Game Theory, and the Modern Quest for a Code of Nature\" at NAP.edu",
      "url": "https://www.nationalacademies.org/read/11631/chapter/2"
    },
    {
      "title": "THE WORK OF JOHN NASH IN GAME THEORY Nobel Seminar, December 8, 1994",
      "url": "https://www.nobelprize.org/uploads/2017/05/nash-lecture.pdf"
    },
    {
      "title": "Game theory - New World Encyclopedia",
      "url": "https://www.newworldencyclopedia.org/entry/Game_theory"
    },
    {
      "title": "Evolutionary games on graphs",
      "url": "https://arxiv.org/pdf/cond-mat/0607344"
    },
    {
      "title": "Mathematical Models, Rational Choice, and the Search for Cold War Culture",
      "url": "https://www.journals.uchicago.edu/doi/full/10.1086/653105"
    },
    {
      "title": "INFORMS NEWS: In Memoriam - John F. Nash Jr. (1928-2015) - INFORMS",
      "url": "https://www.informs.org/ORMS-Today/Public-Articles/August-Volume-42-Number-4/INFORMS-NEWS-In-Memoriam-John-F.-Nash-Jr.-1928-2015"
    },
    {
      "title": "John Nash Awarded the 2015 Abel Mathematics Prize ⋆ Princeton, NJ local news %",
      "url": "https://planetprinceton.com/2015/03/25/john-nash-awarded-the-2015-abel-mathematics-prize/"
    },
    {
      "title": "2015 Abel prize awarded to John F. Nash and Louis Nirenberg",
      "url": "https://gametheorysociety.org/2015-abel-prize-awarded-to-john-f-nash-and-louis-nirenberg/"
    },
    {
      "title": "(PDF) John Nash What a Beautiful Mind",
      "url": "https://www.researchgate.net/publication/370561592_John_Nash_What_a_Beautiful_Mind"
    },
    {
      "title": "A Beautiful Mind",
      "url": "https://parents.simonandschuster.com/9781451628425"
    },
    {
      "title": "A Beautiful Mind",
      "url": "https://en.wikipedia.org/wiki/A_Beautiful_Mind"
    },
    {
      "title": "A Beautiful Mind - The story of John Forbes Nash Jr",
      "url": "https://www.abeautifulmind.com/"
    },
    {
      "title": "Trembling-Hand Perfection and Correlation in Sequential Games",
      "url": "https://ojs.aaai.org/index.php/AAAI/article/view/16700/16507"
    },
    {
      "title": "The Complexity of Equilibrium Refinements in Potential Games",
      "url": "https://arxiv.org/pdf/2511.03968"
    },
    {
      "title": "1 Taming Selten’s Horse with Impulse Response‡",
      "url": "https://www.uibk.ac.at/credence-goods/events/sfb-seminar/documents/sfb_seminar_ws22_neugebauer_paper.pdf"
    },
    {
      "title": "The Complexity of Nash Equilibria Constantinos Daskalakis",
      "url": "https://www2.eecs.berkeley.edu/Pubs/TechRpts/2008/EECS-2008-107.pdf"
    },
    {
      "title": "The complexity of computing a Nash equilibrium",
      "url": "https://dl.acm.org/doi/10.1145/1132516.1132527"
    },
    {
      "title": "Complexity Theory, Game Theory, and Economics: The Barbados Lectures",
      "url": "https://arxiv.org/pdf/1801.00734"
    },
    {
      "title": "On the Complexity of Approximating a Nash Equilibrium",
      "url": "https://dl.acm.org/doi/10.1145/2483699.2483703"
    },
    {
      "title": "Last-iterate Convergence to Trembling-hand Perfect Equilibria",
      "url": "https://arxiv.org/pdf/2208.08238"
    },
    {
      "title": "A Beautiful Mind (book)",
      "url": "https://en.wikipedia.org/wiki/A_Beautiful_Mind_(book)"
    },
    {
      "title": "Nash equilibria: Complexity, symmetries, and approximation - ScienceDirect",
      "url": "https://www.sciencedirect.com/science/article/pii/S1574013709000148"
    },
    {
      "title": "Computational Complexity of Approximate Nash Equilibrium in Large Games",
      "url": "https://arxiv.org/pdf/1405.0524"
    },
    {
      "title": "Trembling-Hand Perfection and Correlation in Sequential Games",
      "url": "https://arxiv.org/pdf/2012.06528"
    },
    {
      "title": "Trembling hand perfect equilibrium",
      "url": "https://en.wikipedia.org/wiki/Trembling_hand_perfect_equilibrium"
    }
  ],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}