Michel Balinski

Louis Michel Balinski ( born October 6, 1933, Geneva ) is an American mathematician, economist and political scientist, well known for contributions to the theory of elections and mathematical optimization.

Balinski is the son of a Polish diplomat at the League of Nations and grandson of Ludwik Rajchman. During the period of National Socialism, his family fled France to the United States, where he grew up bilingual - in the family French is spoken. He graduated from Williams College with a bachelor 's degree in 1954 and at the Massachusetts Institute of Technology with a Master 's degree in 1956. It was founded in 1959 at Princeton University under Albert W. Tucker PhD (An algorithm of finding all vertices of convex polyhedral sets). . afterwards, he was Instructor and Lecturer at Princeton and then from 1963 Associate Professor of Economics at the University of Pennsylvania. In 1965 he became Associate Professor and later Professor of Mathematics at the City University of New York. 1978 to 1980 he was a professor at Yale University and from 1983 to 1989 at the State University of New York at Stony Brook and at the same time at the Ecole Polytechnique ( Laboratory of Econometrics ) and conducted research for the CNRS. He retired in 1999.

In the 1960s, he advised, inter alia, Mobil Oil Research, the City of New York and the Rand Corporation. 1975 to 1977 he was at IIASA in Laxenburg, 1972/73 Visiting Professor in Lausanne and 1974/75 in Grenoble.

Since his thesis he dealt with combinatorics of polyhedra. The set of Balinski (1961 ) makes statements about the networking feature of graphene, the convex polyhedra in three and more dimensions correspond and generalize a set of Ernst Steinitz (1922 ) that polyhedral graphs are exactly of three-dimensional polyhedra, the 3-connected planar graph. Balinski proved that in d dimensions () the graph is at least d -connected, that is removed ( d-1) any node remains the graph connected.

In 1982 he proved with Peyton Young, that it always comes to seat distribution paradoxes in voting systems, when three or more parties compete and the rate condition holds (impossibility set of Balinski and Young).

In 2013 he was awarded the John von Neumann Theory Prize and the 1965 Frederick W. Lanchester Prize -. In 1975 he was awarded the Lester Randolph Ford Award. In 1978 he was awarded an honorary diploma (MA) in Yale and 2004 honorary doctorate from the University of Augsburg.

In 1970, he was with JMW Rhys one of the first who considered the closure problem that eg can be formulated as a problem in the transport networks.

He also made important contributions to linear and nonlinear optimization and mathematical economics.

He has U.S. citizenship.

Writings

  • On the graph structure of convex polyhedra in n -space, Pacific J. Math, Volume 11, 1961, pp. 431-434
  • Integer Programming: Methods, Uses, Computation, Management Science, Volume 12, 1965, 253-313 ( awarded the Lanchester Price )
  • H. Peyton Young: Fair Representation: Meeting the Ideal of One Man, One Vote, Yale University Press 1982, Brookings Institution Press 2001 ISBN 9,780,815,716,341th
  • With Rida Laraki: Majority Judgment: Measuring, Ranking, and Electing, MIT Press, 2010
Stony Brook University Mathematics Genealogy Project Integrated Authority File
101472
de