Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Harold W. Kuhn

Theory of Computation

Harold William Kuhn was an American mathematician who studied game theory, born in 1925 and died in 2014. He won the 1980 John von Neumann Theory Prize jointly with David Gale and Albert W. Tucker, and he was a 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, and he described the Hungarian method for the assignment problem, which he developed and published in 1955.

Facts
Birth Year
1925 1
Harold W. Kuhn
Filter Results1 entry
Connections

Credited

Source Hungarian Algorithm (Wikipedia)

In Field

Source Harold W. Kuhn (Wikipedia)

Invented

Source Hungarian Algorithm (Wikipedia)
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Source Harold W. Kuhn (Wikipedia)Lead section
Quote, Lead section
was an American mathematician who studied game theory
Sources
1. Harold W. Kuhn (Wikipedia)
Lead section
Quote, Lead section
July 29, 1925
View the Source
Hungarian Algorithm (Wikipedia)
  • Credited: Hungarian Algorithm, Lead section
    It was developed and published in 1955 by Harold Kuhn
  • Invented: Hungarian Algorithm, Lead section
    It was developed and published in 1955 by Harold Kuhn
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.