default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichel Balinski
Person information
- affiliation: École Polytechnique and CNRS, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j30]Michel Balinski, Victoriano Ramirez
:
Why webster? Math. Program. 203(1): 239-246 (2024)- 2022
- [j29]Michel Balinski, Rida Laraki:
Majority Judgment vs. Approval Voting. Oper. Res. 70(3): 1296-1316 (2022) - 2020
- [j28]Michel Balinski, Rida Laraki:
Majority judgment vs. majority rule. Soc. Choice Welf. 54(2-3): 429-461 (2020) - 2014
- [j27]Michel Balinski, Victoriano Ramirez:
Parametric vs. divisor methods of apportionment. Ann. Oper. Res. 215(1): 39-48 (2014) - [j26]Michel Balinski, Rida Laraki:
Judge: Don't Vote! Oper. Res. 62(3): 483-511 (2014) - 2009
- [j25]Michel Balinski, Rida Laraki, Sylvain Sorin:
David Gale in Paris. Games Econ. Behav. 66(2): 594-597 (2009) - 2008
- [j24]Michel Balinski:
Fair Majority Voting (or How to Eliminate Gerrymandering). Am. Math. Mon. 115(2): 97-113 (2008) - 2007
- [j23]Michel Balinski:
Equitable representation and recruitment. Ann. Oper. Res. 149(1): 27-36 (2007) - [j22]Mourad Baïou, Michel Balinski:
Characterizations of the optimal stable allocation mechanism. Oper. Res. Lett. 35(3): 392-402 (2007) - 2005
- [j21]Michel Balinski:
What Is Just? Am. Math. Mon. 112(6): 502-511 (2005) - 2004
- [j20]Mourad Baïou, Michel Balinski:
Student admissions and faculty recruitment. Theor. Comput. Sci. 322(2): 245-265 (2004) - 2003
- [j19]Mourad Baïou, Michel Balinski:
Admissions and Recruitment. Am. Math. Mon. 110(5): 386-399 (2003) - 2002
- [j18]Mourad Baïou, Michel Balinski:
The Stable Allocation (or Ordinal Transportation) Problem. Math. Oper. Res. 27(3): 485-503 (2002) - [j17]Mourad Baïou, Michel Balinski:
Erratum: The Stable Allocation (or Ordinal Transportation) Problem. Math. Oper. Res. 27(4): 662-680 (2002) - 2000
- [j16]Mourad Baïou, Michel Balinski:
Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry). Discret. Appl. Math. 101(1-3): 1-12 (2000) - [j15]Mourad Baïou, Michel Balinski:
The stable admissions polytope. Math. Program. 87(3): 427-439 (2000) - 1998
- [j14]Michel Balinski, Niousha Shahidi:
A simple approach to the product rate variation problem via axiomatics. Oper. Res. Lett. 22(4-5): 129-135 (1998) - 1997
- [j13]Michel Balinski, Guillaume Ratier:
Of Stable Marriages and Graphs, and Strategy and Polytopes. SIAM Rev. 39(4): 575-604 (1997) - 1993
- [j12]Michel L. Balinski, Fred J. Rispoli:
Signature classes of transportation polytopes. Math. Program. 60: 127-144 (1993) - 1991
- [j11]Michel L. Balinski, Jaime Gonzalez:
Maximum matchings in bipartite graphs via strong spanning trees. Networks 21(2): 165-179 (1991) - 1989
- [j10]Michel L. Balinski, Gabrielle Demange:
An Axiomatic Approach to Proportionality Between Matrices. Math. Oper. Res. 14(4): 700-719 (1989) - [j9]Michel L. Balinski, Gabrielle Demange:
Algorithms for proportional matrices in reals and integers. Math. Program. 45(1-3): 193-210 (1989) - 1987
- [j8]Michel L. Balinski:
Nominations for 1988 elections. Math. Program. 39(3): 339 (1987) - 1986
- [j7]Michel L. Balinski:
A competitive (dual) simplex method for the assignment problem. Math. Program. 34(2): 125-141 (1986) - [j6]Michel L. Balinski, Thomas M. Liebling, A.-E. Nobs:
On the average length of lexicographic paths. Math. Program. 35(3): 362-364 (1986) - 1985
- [j5]Michel L. Balinski:
Signature Methods for the Assignment Problem. Oper. Res. 33(3): 527-536 (1985) - 1978
- [j4]Michel L. Balinski:
On the reporting of computational experiments. Math. Program. 15(1): 315 (1978) - 1972
- [j3]Michel L. Balinski:
A note on harmonious families. Math. Program. 3(1): 117-123 (1972) - [j2]Michel L. Balinski, Andrew Russakoff:
Some properties of the assignment polytope. Math. Program. 3(1): 257-258 (1972) - 1971
- [j1]Michel L. Balinski, Philip Wolfe:
The journal. Math. Program. 1(1): 1-5 (1971)
Parts in Books or Collections
- 2010
- [p1]Michel Balinski:
Integer Programming: Methods, Uses, Computation. 50 Years of Integer Programming 2010: 133-197
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
