{"52639":{"#nid":"52639","#data":{"type":"event","title":"ACO Distinguished Lecture: Dr. Harold W. Kuhn","body":[{"value":"\u003Cp\u003E\u0022Reflections on a Favorite Child\u0022\u003C\/p\u003E\n\u003Cp\u003EBiography:\u003C\/p\u003E\n\u003Cp\u003EDr. Kuhn\u0027s fields of research include linear and nonlinear programming, the theory of games, combinatorial problems and the application of mathematical techniques to economics. Among his scholarly publications, specifically noteworthy are his work on nonlinear programming (joint with A.W. Tucker, 1950) and on the Hungarian Method for the Assignment Problem (1955).\u003C\/p\u003E\n\u003Cp\u003EHis honors include the John von Neumann Theory Prize of the Operation Research Society of America (jointly with David Gale and A.W. Tucker), the Guggenheim Fellowship, and Fellow of the American Academy of Arts and Science.\u003C\/p\u003E\n\u003Cp\u003EHis recent activities have been centered on game theory. At the Nobel Awards ceremonies in Stockholm in 1994, he chaired a seminar on \u0022The Work of John Nash in Game Theory,\u0022 and in 2002 he co-edited the famous book \u0022The Essential John Nash.\u0022\u003C\/p\u003E\n\u003Cp\u003E\n\u003C\/p\u003E\n\u003Cp\u003EAbstract:\u003C\/p\u003E\n\u003Cp\u003EFifty five years ago, two results of the Hungarian mathematicians, Koenig and Egervary, were combined using the duality theory of linear programming to construct the Hungarian Method for the Assignment Problem. In a recent reexamination of the geometric interpretation of the algorithm (proposed by Schmid in 1978) as a steepest descent method, several variations on the algorithm have been uncovered, which seem to deserve further study.\u003C\/p\u003E\n\u003Cp\u003EThe lecture will be self-contained, assuming little beyond the duality theory of linear programming. The Hungarian Method will be explained at an elementary level and will be illustrated by several examples.\u003C\/p\u003E\n\u003Cp\u003EWe shall conclude with account of a posthumous paper of Jacobi containing an algorithm developed by him prior to 1851 that is essentially identical to the Hungarian Method, thus anticipating the results of Koenig (1931), Egervary (1931), and Kuhn (1955) by many decades.\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":"","uid":"27154","created_gmt":"2010-02-11 15:56:39","changed_gmt":"2016-10-08 01:49:56","author":"Louise Russo","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2008-11-13T15:30:00-05:00","event_time_end":"2008-11-13T16:30:00-05:00","event_time_end_last":"2008-11-13T16:30:00-05:00","gmt_time_start":"2008-11-13 20:30:00","gmt_time_end":"2008-11-13 21:30:00","gmt_time_end_last":"2008-11-13 21:30:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"47223","name":"College of Computing"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}}}