Hervé Moulin

Hervé Moulin (born in 1950 in Paris) is the Donald J. Robertson Chair of Economics at the Adam Smith Business School at the University of Glasgow.[1] He is known for his research contributions in mathematical economics, in particular in the fields of mechanism design, social choice, game theory and fair division.[2][3][4] He has written six books and over 100 peer-reviewed articles.[5][6]

Before joining the University of Glasgow, he was the George A. Peterkin Professor of Economics at Rice University (from 1999 to 2013):,[2] the James B. Duke Professor of Economics at Duke University (from 1989 to 1999)[2][7] and the University Distinguished Professor at Virginia Tech (from 1987 to 1989).[8]

He is a fellow of the Econometric Society since 1983,[9] and a Council Member of the Game Theory Society since 2000.[10] He also served as president of the Society for Social Choice and Welfare for the period of 1998 to 1999.[11] He is a fellow of the Royal Society of Edinburgh.[12]

His research has been supported in part by seven grants from the US National Science Foundation.[13] He collaborates as an adviser with the fair division website Spliddit, created by Ariel Procaccia.[14]

On the occasion of his 65th birthday, the Paris School of Economics and the Aix-Marseille University organised a conference in his honor, with Peyton Young, William Thomson, Salvador Barbera, and Moulin himself as speakers, among others.


Moulin obtained his doctoral degree in Mathematics at the University of Paris in 1975[16] with a thesis on zero sum games, which was published in French at the Mémoires de la Société Mathématique de France[17] and in English in the Journal of Mathematical Analysis and its Applications.[18]

On 1979, he published a seminal paper in Econometrica introducing the notion of dominance solvable games.[19] Dominance solvability is a solution concept for games which is based on an iterated procedure of deletion of dominated strategies by all participants. Dominance solvability is a stronger concept than Nash equilibrium because it does not require ex-ante coordination. Its only requirement is iterated common knowledge of rationality. His work on this concept was mentioned in Eric Maskin‘s Nobel Prize Lecture.[20]

One year later he proved an interesting result concerning the famous Gibbard-Satterthwaite Theorem,[21] which states that any voting procedure on the universal domain of preferences whose range contains more than two alternatives is either dictatorial or manipulable. Moulin proved that it is possible to define non-dictatorial and non manipulable social choice functions in the restricted domain of single-peaked preferences, i.e. those in which there is a unique best option, and other options are better as they are closer to the favorite one. Moreover, he provided a characterization of such rules.[22] This paper inspired a whole literature on achieving strategy-proofness and fairness (even in a weak form as non-dictatorial schemes) on restricted domains of preferences.[23][24]

Moulin is also known for his seminal work in cost sharing[4][25][26] and assignment problems.[27][28]


Moulin has published work jointly with Matthew O. Jackson,[29] Scott Shenker,[30] and Anna Bogomolnaia,[31] among many other academics.


ID Event Name Duration Start Date
ERMAS 2016 2 Days August 1, 2016

Powered by themekiller.com