M. Balinski

Publications106
h-index30
Citations4,327
Highly Influential Citations409
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • R. Laraki
  • 121 Publications, 1,205 Citations
  • A. Roth
  • 354 Publications, 36,812 Citations
  • H. P. Young
  • 169 Publications, 14,754 Citations
  • D. Gale
  • 191 Publications, 9,190 Citations
  • Publications
  • Influence
A Tale of Two Mechanisms: Student Placement
Abstract A new class of matching problems that models centralized college admissions via standardized tests is presented. The allocation mechanism that is used in real-life applications of this… Expand
  • 504
  • 85
  • PDF
A theory of measuring, electing, and ranking
  • M. Balinski, R. Laraki
  • Computer Science, Medicine
  • Proceedings of the National Academy of Sciences
  • 22 May 2007
TLDR
The impossibility theorems that abound in the theory of social choice show that there can be no satisfactory method for electing and ranking in the context of the traditional, 700-year-old model. Expand
  • 177
  • 34
  • PDF
On an Integer Program for a Delivery Problem
An actual truck delivery problem of general applicability is stated as an integer program. The successful computational performance of Gomory's "cutting plane" algorithm for a set of nine particular… Expand
  • 351
  • 23
Majority Judgment: Measuring, Ranking, and Electing
In Majority Judgment, Michel Balinski and Rida Laraki argue that the traditional theory of social choice offers no acceptable solution to the problems of how to elect, to judge, or to rank. They find… Expand
  • 183
  • 23
Integer Programming: Methods, Uses, Computations
TLDR
This paper attempts to present the major methods, successful or interesting uses, and computational experience relating to integer or discrete programming problems. Expand
  • 505
  • 22
Fixed‐cost transportation problems
This paper formulates a fixed‐cost transportation problem as an integer program, describes some of its special properties, and suggests an approximate method of solution. Examples are given to… Expand
  • 268
  • 17
Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
TLDR
We show that the major results known for the marriage and university admissions problems — the one-to one and many-to-one stable matching problems — are shown to have equivalents in the general many- to-many setting. Expand
  • 96
  • 16
Integer Programming: Methods, Uses, Computation
  • M. Balinski
  • Computer Science
  • 50 Years of Integer Programming
  • 2010
  • 95
  • 16
Algorithms for proportional matrices in reals and integers
TLDR
A number of axiomatic approaches have been developed to ascribe meanings to the statements: the real matrixf ∈ R and the integer matrixa are “proportional to” a given matrixp ≥ 0. Expand
  • 77
  • 13
The stable admissions polytope
TLDR
The stable admissions polytope is a convex hull of the stable assignments of the university admissions problem that is described by a set of linear inequalities. Expand
  • 44
  • 13
  • PDF