Michel Balinski

Michel Louis Balinski

From left: Michel Balinski, Friedrich Pukelsheim, Steven Brams, Oberwolfach 2004
Born (1933-10-06) October 6, 1933
Geneva, Switzerland
Residence France
Nationality American, Polish
Fields Mathematics, Economics, Operations Research, Political Science
Alma mater Princeton University
Doctoral advisor Albert W. Tucker
Doctoral students Louis Billera
Notable awards John von Neumann Theory Prize (2013)

Michel Louis Balinski (born October 6, 1933) is an applied mathematician, economist, operations research analyst and political scientist. American, educated in the United States, he has lived and worked primarily in the United States and France. He is known for his work in optimization (combinatorial, linear, nonlinear), convex polyhedra, stable matching, and the theory and practice of electoral systems, jury decision, and social choice. He is Directeur de Recherche de classe exceptionnelle (emeritus) of the C.N.R.S. at the Ecole Polytechnique (Paris). He was awarded the John von Neumann Theory Prize by INFORMS in 2013.

Early life

Michel Balinski was born in Geneva, Switzerland, the son of a Polish diplomat at the League of Nations and the grandson of the Polish bacteriologist and UNICEF founder Ludwik Rajchman.[1] He was living with his grandparents in France when in 1940 the family fled the Nazis via Spain and Portugal to the United States. He graduated from the Edgewood School in Greenwich CT in 1950, earned a B.A. degree cum laude in mathematics at Williams College in 1954 and a M.Sc. in economics at the Massachusetts Institute of Technology in 1956. He completed a Ph.D. in mathematics at Princeton University in 1959 under the supervision of Albert W. Tucker.[1][2]

Career

After completing his Ph.D. Balinski remained at Princeton University as a Research Associate then Lecturer in mathematics. From 1963 to 1965 he was Associate Professor of Economics at the Wharton School of the University of Pennsylvania. He was then appointed to the Graduate School of the City University of New York, first as Associate Professor then (as of 1969) Professor of Mathematics. One of his doctoral students at the City University was another noted mathematician, Louis Billera, through whom he has many academic descendants. In 1978 he was appointed Professor of Organization and Management and of Administrative Sciences at Yale.

In parallel with his academic work Balinski engaged in consulting as of the time he was a graduate student at Princeton. A participant in the beginnings of what became the consulting firm Mathematica, he was a Senior Consultant with the firm from 1962 to 1974. He also acted as a consultant elsewhere, including the Rand Corporation, Mobil Oil Research, the ORTF (Office de Radiodiffusion-Télévision Française), the Mayor’s office of the City of New York (as member of the Operations Research Council), and Econ, Inc. From 1975 to 1977 he was Chairman of System and Decision Sciences at IIASA (International Institute for Applied Systems Analyses) at Laxenburg, Austria.

In 1980 Michel Balinski settled in France, becoming Directeur de Recherche de classe exceptionnelle of the CNRS (Centre National de Recherche Scientifique) at the Laboratoire d’Econométrie of the Ecole Polytechnique in 1983. Concurrently he was Leading Professor of Applied Mathematics and Statistics and of Economics at SUNY (State University of New York) Stony Brook (1983-1990), where he founded and was the first Director of the Institute for Decision Sciences (that has since become the Center for Game Theory in Economics).

Upon becoming Director of the Laboratoire d’Econométrie (1989 to 1999) he co-founded and co-directed the joint Ecole Polytechnique/Université de Paris 1 master program “Modélisation et methodes mathématiques en économie: optimisation et analyse stratégiques,” and its successor the joint Ecole Polytechnique/Université Pierre et Marie Curie (Paris 6) master program “Optimisation, jeux et modélisation en économie.” [3]

He was a visiting professor at other institutions, including the Ecole Polytechnique Fédérale de Lausanne (1972-1973), the Université Scientifique et Médicale de Grenoble (1974-1975), the Universidad de Chile in Santiago (1994), and INSEAD in Fontainebleau (1997-1998).[1][3]

Balinski was the founding Editor-in-Chief of the journal Mathematical Programming in 1971, one of the founders of the Mathematical Optimization Society in 1970, and President of that society from1986 to 1989.[4]

Research contributions

Balinski’s Ph.D. thesis concerned the vertex enumeration problem, the algorithmic problem of listing all vertices of a convex polytope or finding all optimal solutions of a linear program,[2] and some of his subsequent work continued to concern polyhedral combinatorics. The thesis includes the fundamental theorem, published in 1961, that the skeletons of polytopes in "n"-space viewed as graphs are "n"-connected, meaning that at least "n" edges must be removed to disconnect the graph of the remaining vertices and edges.[5] He also proved the Hirsch conjecture for several different classes of polytopes associated with the transportation problem, showed that the diameter of the skeleton of the assignment polytope viewed as a graph is 2, and found the polytope whose vertices are the stable matchings of the university admissions problem.[6]

His contributions to linear and nonlinear optimization include a primal/dual simplex method that incorporates a natural proof of termination and leads to a self-contained, elementary but rigorous, constructive account of the theory and the basic computational tool of linear programming; the use and economic interpretation of dual prices; and a proof that prices in von Neumann’s model of an expanding economy are marginal values. His work in integer programming includes the formulation and analysis of the fixed cost transportation problem; one of the first computationally successful practical uses of Gomory’s cutting plane algorithm (1968, truck deliveries with cost functions in part concave, in part convex); and an extensive survey paper on integer programming which was awarded INFORM’s Lanchester Prize in 1965.

In 1970, he published one of the earliest papers on the closure problem and its applications to transportation planning.[7]

Balinski has made important contributions to the theory of electoral systems, namely, representation and apportionment on the one hand, and voting on the other. His 1982 book with H. Peyton Young has had direct practical application in apportioning the seats of assemblies to regions in several countries (including the UK). He conceived and developed with others “biproportional apportionment” that has been adopted (as of 2014) in five of Switzerland’s cantonal elections. His 2010 book with Rida Laraki proposes a new theory and method of voting called “majority judgment” where voters evaluate the merit of each candidate in a well-defined ordinal scale (instead of voting for one or several candidates, or rank-ordering them) and majorities determine society’s evaluation of each candidate and thereby its rank-ordering of them all. This, they prove, overcomes the most important drawbacks of the traditional theory of voting (including Arrow’s impossibility theorem).[6]

Awards and honors

Phi Beta Kappa, Williams College, 1954; Frederick W. Lanchester Prize, INFORMS, 1965; I.B.M. World Trade Corporation Fellow, 1969-1970; Lester R. Ford Award, Mathematical Association of America, 1976;[8] Honorary Master of Arts, Privatum, Yale University, 1978; Special Service Award, Mathematical Optimization Society, 1982; Honorary Doctorate (Ehrendoktors, Mathematisch-Naturwissenshaftlichen) Universität Augsburg, 2004;[1] Murat Sertel Lecturer (inaugural lecture), 8th International Meeting of the Society for Social Choice and Welfare, Istanbul, July 2006; Messenger Lecturer, Cornell University, September 2007; IFORS Distinguished Lecturer, INFORMS National Meeting, Washington, D.C., October 2008; George H. Hallet Award, 2009; Lester R. Ford Award, Mathematical Association of America, 2009;[9] Celebration of Michel Balinski’s 78 years at the 23rd International Conference on Game Theory, SUNY Stony Brook, July 2012; John von Neumann Theory Prize, INFORMS, 2013; INFORMS Fellow, 2014.[6]

Selected publications

Books

Articles

References

  1. 1 2 3 4 Laudatio, Friedrich Pukelsheim, University of Augsburg, retrieved 2013-11-27.
  2. 1 2 Michel Louis Balinski at the Mathematics Genealogy Project
  3. 1 2 Michel Balinski receives the 2013 John von Neumann Theory Prize, École Polytechnique, retrieved 2013-11-27.
  4. ↑ Wolfe, Philip, The Mathematical Programming Society (PDF), Mathematical Optimization Society, retrieved 2013-11-27.
  5. ↑ Ziegler, Günter M. (1995), "Section 3.5: Balinski's Theorem: The Graph is d-Connected", Lectures on Polytopes, Graduate Texts in Mathematics, 152, Springer-Verlag.
  6. 1 2 3 INFORMS award recipients: Michel L. Balinski, retrieved 2013-11-27.
  7. ↑ Hochbaum, Dorit (2004), "50th Anniversary Article: Selection, Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today", Management Science, 50 (6): 709–723, doi:10.1287/mnsc.1040.0242.
  8. ↑ Balinski, Michel L.; Young, H. P. (1975). "The quota method of apportionment" (PDF). Amer. Math. Monthly. 82: 701–730. doi:10.2307/2318729.
  9. ↑ Balinski, Michel (2008). "Fair Majority Voting (or How to Eliminate Gerrymandering)". Amer. Math. Monthly. 115 (2): 97–113.
This article is issued from Wikipedia - version of the 11/30/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.