H. Kuhn

Publications73
h-index28
Citations15,232
Highly Influential Citations707
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • J. Harsanyi
  • 152 Publications • 16,047 Citations
  • J. Neumann
  • 330 Publications • 46,823 Citations
  • R. Tarjan
  • 433 Publications • 68,238 Citations
  • J. Nash
  • 92 Publications • 24,646 Citations
  • Publications
  • Influence
The Hungarian method for the assignment problem
This paper has always been one of my favorite “children,” combining as it does elements of the duality of linear programming and combinatorial tools from graph theory. It may be of some interest to…
The Hungarian Method for the Assignment Problem
  • H. Kuhn
  • Mathematics
    50 Years of Integer Programming
  • 2010
This paper has always been one of my favorite “children,” combining as it does elements of the duality of linear programming and combinatorial tools from graph theory. It may be of some interest to…
Contributions to the theory of games
The description for this book, Contributions to the Theory of Games (AM-40), Volume IV, will be forthcoming.
A note on Fermat's problem
  • H. Kuhn
  • Mathematics
    Math. Program.
  • 1 December 1973
TLDR
This note calls attention to the work of Weiszfeld in 1937, who may have been the first to propose an iterative algorithm for the General Fermat Problem.
Some Combinatorial Lemmas in Topology
  • H. Kuhn
  • Mathematics
    IBM J. Res. Dev.
  • 1 November 1960
TLDR
This central result of this paper is a combinatorial proposition, analogous to the Sperner Lemma, and applying to the n-cube, for which subdivision is a trivial operation.
Nonlinear programming: a historical view
TLDR
A historical survey of the origins of nonlinear programming is presented, illustrated by duality theorems for nonlinear programs that antedate the modern development of the subject.
AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES.
  • H. Kuhn
  • Mathematics
    Proceedings of the National Academy of Sciences…
  • 1 October 1961
TLDR
The proof of Lemma 1 is bagbd on the fact that 7rn+3(S5) is cyclic of order 24 for n > 5 in any regular neighborhoods of K in M.
Simplicial approximation of fixed points.
  • H. Kuhn
  • Mathematics
    Proceedings of the National Academy of Sciences…
  • 1 December 1968
Contribution to the Theory of Games
Classics in Game Theory
Classics in Game Theory assembles in one sourcebook the basic contributions to the field that followed on the publication of Theory of Games and Economic Behavior by John von Neumann and Oskar…
...
1
2
3
4
5
...