Steven Brams

Steven Brams

Steven J. Brams (born November 28, 1940) is a game theorist and political scientist at the New York University department of politics. Brams is best known for using the techniques of game theory and public choice to research voting systems and fair division. He is one of the independent discoverers of approval voting. Also, he was a co-discoverer, with Alan Taylor of the first envy-free solution to the n-person cake cutting problem.(1) Previous to the Brams-Taylor solution, the cake cutting problem had been one of the most important open problems in contemporary mathematics.(2) In 2006 with others he devised an optimal alternative to the ancient procedure of divide and choose.(3)

Brams was born in Concord, New Hampshire. He earned his B.S. at Massachusetts Institute of Technology in Politics, Economics, and Science in 1962. In 1966, he went on to earn his Ph.D. in Political Science at Northwestern University.

He worked briefly in U.S. federal government positions before taking an Assistant Professor position at Syracuse University in 1967. He moved to New York University in 1969, where he is a Professor in the Department of Politics. From 2004-2006, he was president of the Public Choice Society.(4)


# Will Hively. Dividing the spoils - Steven Brams, Alan Taylor devise procedure to divide anything equitably. Discover Magazine. March 1995.
# Sol Garfunkel. More Equal than Others: Weighted Voting. For All Practical Purposes. COMAP. 1988.
# [ Better Ways to Cut a Cake] by Steven J. Brams, Michael A. Jones, and Christian Klamler in the Notices of the American Mathematical Society December 2006.

External links

* [ Steven Brams - NYU]

Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Steven Brams — Steven J. Brams (né le 28 novembre 1940 à Concord, au New Hampshire) est un théoricien politique et scientifique de l Université de New York (département de la politique). Brams est surtout connu pour utiliser les techniques de la… …   Wikipédia en Français

  • Approval voting — is a single winner voting system used for elections. Each voter may vote for (approve of) as many of the candidates as they wish. The winner is the candidate receiving the most votes. Each voter may vote for any combination of candidates and may… …   Wikipedia

  • Fair division — Cake cutting redirects here. For the wedding tradition, see Wedding reception#Wedding cake. Fair division, also known as the cake cutting problem, is the problem of dividing a resource in such a way that all recipients believe that they have… …   Wikipedia

  • Partage équitable — En économie, mais aussi en mathématiques, et plus particulièrement en théorie des jeux, le problème du partage équitable, connu aussi sous le nom de problème de partage du gâteau (de l anglais cake cutting problem), est le problème du partage d… …   Wikipédia en Français

  • Divide and choose — In problems of fair division, divide and choose (also I cut, you choose) is a two party proportional envy free allocation protocol.[1] The protocol also works for dividing an undesirable, as in chore division. In the method, one person divides a… …   Wikipedia

  • Mathematics and Physical Sciences — ▪ 2003 Introduction Mathematics       Mathematics in 2002 was marked by two discoveries in number theory. The first may have practical implications; the second satisfied a 150 year old curiosity.       Computer scientist Manindra Agrawal of the… …   Universalium

  • Alan D. Taylor — Alan Dana Taylor is a mathematician who, with Steven Brams, solved the problem of envy free Fair division for an arbitrary number of people.Taylor received his Ph.D. in 1975 from Dartmouth College. [MathGenealogy|id=38715] He currently is the… …   Wikipedia

  • Voto aprobatorio — En las papeletas de votación en el voto aprobatorio, el votante puede votar por el número de candidatos que desee. El voto aprobatorio es un sistema de votación utilizado para las elecciones en el cual un votante puede votar por todos los… …   Wikipedia Español

  • Envy-free — In mathematical sociology and especially game theory, envy free is a property of certain fair division algorithms for a divisible heterogeneous good over which different players may have different preferences.cite journal |last=Brams… …   Wikipedia

  • Tactical voting — In voting systems, tactical voting (or strategic voting or sophisticated voting) occurs when a voter supports a candidate other than his or her sincere preference in order to prevent an undesirable outcome. It has been shown by the Gibbard… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.