Hervé Moulin

According to our database1, Hervé Moulin authored at least 49 papers between 1976 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 



On csauthors.net:


The Unreasonable Fairness of Maximum Nash Welfare.
ACM Trans. Economics and Comput., 2019

Dividing bads under additive utilities.
Soc. Choice Welf., 2019

A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation.
CoRR, 2019

A simple Online Fair Division problem.
CoRR, 2019

Fair Mixing: the Case of Dichotomous Preferences.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Consistent bilateral assignment.
Math. Soc. Sci., 2017

Competitive division of a mixed manna.
CoRR, 2017

Proceedings of the Handbook of Computational Social Choice, 2016

Entropy, desegregation, and proportional rationing.
J. Econ. Theory, 2016

Dividing goods and bads under additive utilities.
CoRR, 2016

Dividing goods or bads under additive utilities.
CoRR, 2016

Size versus fairness in the assignment problem.
Games Econ. Behav., 2015

Improving Nash by coarse correlation.
J. Econ. Theory, 2014

Pricing traffic in a spanning network.
Games Econ. Behav., 2014

Sharing the cost of redundant items.
Games Econ. Behav., 2014

Egalitarianism under earmark constraints.
J. Econ. Theory, 2013

The Bipartite Rationing Problem.
Oper. Res., 2013

Cost Sharing in Networks: some Open Questions.
IGTR, 2013

The price of imperfect competition for a spanning network.
Games Econ. Behav., 2013

Loss calibrated methods for bipartite rationing: bipartite rationing.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Rationing problems in bipartite networks.
SIGecom Exch., 2012

Equal-need sharing of a network under connectivity constraints.
Games Econ. Behav., 2011

Auctioning or assigning an object: some remarkable VCG mechanisms.
Soc. Choice Welf., 2010

Sharing the Cost of a Capacity Network.
Math. Oper. Res., 2010

Bargaining among groups: an axiomatic viewpoint.
Int. J. Game Theory, 2010

An efficient and almost budget balanced cost sharing method.
Games Econ. Behav., 2010

Sharing a minimal cost spanning tree: Beyond the Folk solution.
Games Econ. Behav., 2010

Clearing supply and demand under bilateral constraints.
Proceedings of the Behavioral and Quantitative Game Theory, 2010

Almost budget-balanced VCG mechanisms to assign multiple objects.
J. Econ. Theory, 2009

A Combinatorial Inequality: 11269.
Am. Math. Mon., 2008

Impartial division of a dollar.
J. Econ. Theory, 2008

Proportional scheduling, split-proofness, and merge-proofness.
Games Econ. Behav., 2008

An advocate of cooperative theory.
Games Econ. Behav., 2008

Problem 11269.
Am. Math. Mon., 2007

On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs.
Math. Oper. Res., 2007

Minimizing the Worst Slowdown: Offline, Online.
Oper. Res., 2007

Efficient cost sharing with a cheap residual claimant.
Proceedings of the Fair Division, 24.06. - 29.06.2007, 2007

Strategy-proof assignment with a vanishing budget surplus.
Proceedings of the Computational Social Systems and the Internet, 1.7. - 6.7.2007, 2007

Responsibility and cross-subsidization in cost sharing.
Games Econ. Behav., 2006

On demand responsiveness in additive cost sharing.
J. Econ. Theory, 2005

Collective choice under dichotomous preferences.
J. Econ. Theory, 2005

Filling a multicolor urn: an axiomatic analysis.
Games Econ. Behav., 2003

Fair division and collective welfare.
MIT Press, ISBN: 978-0-262-63311-6, 2003

The proportional random allocation of indivisible units.
Soc. Choice Welf., 2002

Fair Queuing and Other Probabilistic Allocation Methods.
Math. Oper. Res., 2002

A New Solution to the Random Assignment Problem.
J. Econ. Theory, 2001

Scheduling with Opting Out: Improving upon Random Priority.
Oper. Res., 2001

Non-cooperative implementation: A survey of recent results.
Math. Soc. Sci., 1982

Cooperation in Mixed Equilibrium.
Math. Oper. Res., 1976