Harold W. Kuhn | Academic Influence

Harold W. Kuhn's AcademicInfluence.com Rankings

Harold W. Kuhn

Mathematics

#150

World Rank

#357

Historical Rank

#65

USA Rank

Measure Theory

#247

World Rank

#384

Historical Rank

#110

USA Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Harold W. Kuhn Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Harold William Kuhn was an American mathematician who studied game theory. He won the 1980 John von Neumann Theory Prize jointly with David Gale and Albert W. Tucker. A former Professor Emeritus of Mathematics at Princeton University, he is known for the Karush–Kuhn–Tucker conditions, for Kuhn's theorem, and for developing Kuhn poker. He described the Hungarian method for the assignment problem, but a paper by Carl Gustav Jacobi, published posthumously in 1890 in Latin, was later discovered that had described the Hungarian method a century before Kuhn.

(See a Problem?)

Harold W. Kuhn's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The Hungarian method for the assignment problem (1955) (10056)
Contributions to the theory of games (1953) (2525)
A note on Fermat's problem (1973) (351)
Contribution to the Theory of Games (1951) (213)
Some Combinatorial Lemmas in Topology (1960) (191)
Nonlinear programming: a historical view (1982) (183)
Simplicial approximation of fixed points. (1968) (180)
Classics in Game Theory (1997) (117)
AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES. (1961) (100)
Sandwich method for finding fixed points (1975) (75)
Extensive Games. (1950) (73)
An approximative algorithm for the fixed‐charges transportation problem (1962) (73)
The work of John Nash in game theory (1995) (65)
Contributions to the Theory of Games, Vol. II (1954) (60)
John von Neumann’s work in the theory of games and mathematical economics (1958) (59)
Lectures on the theory of games (2003) (56)
ON 2-SPHERES IN 4-MANIFOLDS (47)
Proceedings of the Princeton Symposium on Mathematical Programming (1971) (46)
A new proof of the fundamental theorem of algebra (1974) (41)
1. THE ELEMENTARY THEORY OF CONVEX POLYHEDRA (1951) (41)
An Efficient Algorithm for the Numerical Solution of the Generalized Weber Problem in Spatial Economics (1992) (37)
Definitions for a theory of games and pursuit (1960) (35)
Duality in Mathematical Programming (1969) (34)
A tale of three eras: The discovery and rediscovery of the Hungarian Method (2012) (32)
Systems of Distinct Representations and Linear Programming (1956) (32)
A proof of the existence of equilibrium without the free disposal assumption (1975) (31)
2. ELEMENTARY PROOF OF A MINIMAX THEOREM DUE TO VON NEUMANN (1951) (31)
Contributions to the Theory of Games (AM-39), Volume III (1951) (29)
A celebration of John F. Nash, Jr. (1996) (28)
Factor Endowments and Factor Prices (1959) (25)
Finding Roots of Polynomials By Pivoting (1977) (24)
Combinatorial Approach to the N‐Representability of P‐Density Matrices (1969) (24)
Mathematical systems theory and economics (1969) (22)
Linear Inequalities and Related Systems. (AM-38) (1957) (21)
Total Quality Management and the Public Sector (1996) (18)
The work of John F. Nash Jr. in game theory. (1995) (17)
SUBGROUP THEOREMS FOR GROUPS PRESENTED BY GENERATORS AND RELATIONS (1952) (16)
Game theory and models of negotiation (1962) (16)
On the cost of computing roots of polynomials (1984) (15)
Nonlinear Programming: A Historical Note (2010) (14)
Being in the Right Place at the Right Time (2002) (14)
Letter to the Editor---On Upper Bounds for the Number of Iterations in Solving Linear Programs (1964) (13)
Introduction to John von Neuman and Oskar Morgenstern's Theory of Games and Economic Behavior (2007) (11)
7. ON SYMMETRIC GAMES (1951) (10)
Chapter 2. On Games of Fair Division (1967) (9)
Contractibility and convexity (1954) (8)
Lectures on the Theory of Games (AM-37) (2003) (6)
The sandwich method for computing fixed points (1973) (4)
10. On Systems of Distinct Representatives (1957) (3)
Pathfix: An algorithm for computing traffic equilibria (1977) (2)
NETWORK AGGREGATION IN TRANSPORTATION PLANNING. VOLUME II: A FIXED POINT METHOD FOR TREATING TRAFFIC EQUILIBRIA (1978) (2)
JMIM: A Feature Selection Technique using Joint Mutual Information Maximization Approach (2020) (2)
Public Administration: A Diversity of Approaches@@@The Craft of Public Administration@@@Public Administration: An Action Orientation@@@Public Administration: Policy, Politics and Practice@@@Politics and Public Management: An Introduction@@@Public Administration in Action: Readings, Profiles & Cases (1993) (2)
Locational Problems And Mathematical Programming (2010) (2)
16. On a Theorem of Wald (1957) (1)
Some Remarks On Games Of Fair Division (2011) (1)
On Two Theorems In International Trade (2011) (1)
8. REDUCTIONS OP GAME MATRICES (1951) (1)
THE APPLICATION OF GAME THEORY TO ASW DETECTION PROBLEMS (1967) (1)
Chapter One What Is the Theory of Games ? (2002) (0)
Mathematics in the Movies: A Case Study (2012) (0)
Chapter 3. Extensive Games (2003) (0)
Chapter 4. Infinite Games (2003) (0)
Author’s Note (2003) (0)
Preface to The Essential John Nash (2007) (0)
Synthetic systems and applications. Group report (1979) (0)
Chapter 1. What Is the Theory of Games (2003) (0)
Chapter 2. Matrix Games (2003) (0)
A Few Remarks on the History of Mst{problem Dedicated to the Memory of Professor Otakar Bor Uvka (1997) (0)

This paper list is powered by the following services:

Other Resources About Harold W. Kuhn

en.wikipedia.org

What Schools Are Affiliated With Harold W. Kuhn?

Harold W. Kuhn is affiliated with the following schools:

Princeton University

Image Attributions

Image Source for Harold W. Kuhn