The journal. - Michel L. Balinski; Philip Wolfe (Math. Program., 1971)

A note on harmonious families. - Michel L. Balinski (Math. Program., 1972)

Some properties of the assignment polytope. - Michel L. Balinski; Andrew Russakoff (Math. Program., 1972)

On the reporting of computational experiments. - Michel L. Balinski (Math. Program., 1978)

Signature Methods for the Assignment Problem. - Michel L. Balinski (Oper. Res., 1985)

A competitive (dual) simplex method for the assignment problem. - Michel L. Balinski (Math. Program., 1986)

On the average length of lexicographic paths. - Michel L. Balinski; Thomas M. Liebling; A.-E. Nobs (Math. Program., 1986)

Nominations for 1988 elections. - Michel L. Balinski (Math. Program., 1987)

An Axiomatic Approach to Proportionality Between Matrices. - Michel L. Balinski; Gabrielle Demange (Math. Oper. Res., 1989)

Algorithms for proportional matrices in reals and integers. - Michel L. Balinski; Gabrielle Demange (Math. Program., 1989)

Maximum matchings in bipartite graphs via strong spanning trees. - Michel L. Balinski; Jaime Gonzalez (Networks, 1991)

Signature classes of transportation polytopes. - Michel L. Balinski; Fred J. Rispoli (Math. Program., 1993)

Of Stable Marriages and Graphs, and Strategy and Polytopes. - Michel Balinski; Guillaume Ratier (SIAM Rev., 1997)

A simple approach to the product rate variation problem via axiomatics. - Michel Balinski; Niousha Shahidi (Oper. Res. Lett., 1998)

Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry). - Mourad Baïou; Michel Balinski (Discret. Appl. Math., 2000)

The stable admissions polytope. - Mourad Baïou; Michel Balinski (Math. Program., 2000)

The Stable Allocation (or Ordinal Transportation) Problem. - Mourad Baïou; Michel Balinski (Math. Oper. Res., 2002)

Erratum: The Stable Allocation (or Ordinal Transportation) Problem. - Mourad Baïou; Michel Balinski (Math. Oper. Res., 2002)

Admissions and Recruitment. - Mourad Baïou; Michel Balinski (Am. Math. Mon., 2003)

Student admissions and faculty recruitment. - Mourad Baïou; Michel Balinski (Theor. Comput. Sci., 2004)

What Is Just? - Michel Balinski (Am. Math. Mon., 2005)

Equitable representation and recruitment. - Michel Balinski (Ann. Oper. Res., 2007)

Characterizations of the optimal stable allocation mechanism. - Mourad Baïou; Michel Balinski (Oper. Res. Lett., 2007)

Fair Majority Voting (or How to Eliminate Gerrymandering). - Michel Balinski (Am. Math. Mon., 2008)

David Gale in Paris. - Michel Balinski; Rida Laraki; Sylvain Sorin (Games Econ. Behav., 2009)

Integer Programming: Methods, Uses, Computation. - Michel Balinski (50 Years of Integer Programming, 2010)

Parametric vs. divisor methods of apportionment. - Michel Balinski; Victoriano Ramirez (Ann. Oper. Res., 2014)

Judge: Don't Vote! - Michel Balinski; Rida Laraki (Oper. Res., 2014)

Majority judgment vs. majority rule. - Michel Balinski; Rida Laraki (Soc. Choice Welf., 2020)

Majority Judgment vs. Approval Voting. - Michel Balinski; Rida Laraki (Oper. Res., 2022)

Why webster? - Michel Balinski; Victoriano Ramirez (Math. Program., 2024)