Cooperation in Mixed Equilibrium. - Hervé Moulin 001 (Math. Oper. Res., 1976)

Non-cooperative implementation: A survey of recent results. - Hervé Moulin 001 (Math. Soc. Sci., 1982)

Scheduling with Opting Out: Improving upon Random Priority. - Hervé Crès; Hervé Moulin 001 (Oper. Res., 2001)

A New Solution to the Random Assignment Problem. - Anna Bogomolnaia; Hervé Moulin 001 (J. Econ. Theory, 2001)

Fair Queuing and Other Probabilistic Allocation Methods. - Hervé Moulin 001; Richard Stong (Math. Oper. Res., 2002)

The proportional random allocation of indivisible units. - Hervé Moulin 001 (Soc. Choice Welf., 2002)

Fair division and collective welfare. - Hervé Moulin 001 (MIT Press, 2003)

Filling a multicolor urn: an axiomatic analysis. - Hervé Moulin 001; Richard Stong (Games Econ. Behav., 2003)

Collective choice under dichotomous preferences. - Anna Bogomolnaia; Hervé Moulin 001; Richard Stong (J. Econ. Theory, 2005)

On demand responsiveness in additive cost sharing. - Hervé Moulin 001; Yves Sprumont (J. Econ. Theory, 2005)

Responsibility and cross-subsidization in cost sharing. - Hervé Moulin 001; Yves Sprumont (Games Econ. Behav., 2006)

Strategy-proof assignment with a vanishing budget surplus. - Hervé Moulin 001 (Computational Social Systems and the Internet, 2007)

Efficient cost sharing with a cheap residual claimant. - Hervé Moulin 001 (Fair Division, 2007)

Minimizing the Worst Slowdown: Offline, Online. - Hervé Moulin 001 (Oper. Res., 2007)

On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs. - Hervé Moulin 001 (Math. Oper. Res., 2007)

Problem 11269. - Hervé Moulin 001 (Am. Math. Mon., 2007)

An advocate of cooperative theory. - Hervé Moulin 001 (Games Econ. Behav., 2008)

Proportional scheduling, split-proofness, and merge-proofness. - Hervé Moulin 001 (Games Econ. Behav., 2008)

Impartial division of a dollar. - Geoffroy de Clippel; Hervé Moulin 001; T. Nicolaus Tideman (J. Econ. Theory, 2008)

A Combinatorial Inequality: 11269. - Hervé Moulin 001 (Am. Math. Mon., 2008)

Almost budget-balanced VCG mechanisms to assign multiple objects. - Hervé Moulin 001 (J. Econ. Theory, 2009)

Clearing supply and demand under bilateral constraints. - Olivier Bochet; Hervé Moulin 001; Rahmi Ilkiliç (BQGT, 2010)

Sharing a minimal cost spanning tree: Beyond the Folk solution. - Anna Bogomolnaia; Hervé Moulin 001 (Games Econ. Behav., 2010)

An efficient and almost budget balanced cost sharing method. - Hervé Moulin 001 (Games Econ. Behav., 2010)

Bargaining among groups: an axiomatic viewpoint. - Suchan Chae; Hervé Moulin 001 (Int. J. Game Theory, 2010)

Sharing the Cost of a Capacity Network. - Anna Bogomolnaia; Ron Holzman; Hervé Moulin 001 (Math. Oper. Res., 2010)

Auctioning or assigning an object: some remarkable VCG mechanisms. - Hervé Moulin 001 (Soc. Choice Welf., 2010)

Equal-need sharing of a network under connectivity constraints. - Hervé Moulin 001; Francois Laigret (Games Econ. Behav., 2011)

Rationing problems in bipartite networks. - Hervé Moulin 001; Jay Sethuraman (SIGecom Exch., 2012)

Loss calibrated methods for bipartite rationing: bipartite rationing. - Hervé Moulin 001; Jay Sethuraman (EC, 2013)

The price of imperfect competition for a spanning network. - Hervé Moulin 001; Rodrigo A. Velez (Games Econ. Behav., 2013)

Cost Sharing in Networks: some Open Questions. - Hervé Moulin 001 (IGTR, 2013)

The Bipartite Rationing Problem. - Hervé Moulin 001; Jay Sethuraman (Oper. Res., 2013)

Egalitarianism under earmark constraints. - Olivier Bochet; Rahmi Ilkiliç; Hervé Moulin 001 (J. Econ. Theory, 2013)

Sharing the cost of redundant items. - Jens Leth Hougaard; Hervé Moulin 001 (Games Econ. Behav., 2014)

Pricing traffic in a spanning network. - Hervé Moulin 001 (Games Econ. Behav., 2014)

Improving Nash by coarse correlation. - Hervé Moulin 001; Indrajit Ray; Sonali Sen Gupta (J. Econ. Theory, 2014)

Size versus fairness in the assignment problem. - Anna Bogomolnaia; Hervé Moulin 001 (Games Econ. Behav., 2015)

Dividing goods or bads under additive utilities. - Anna Bogomolnaia; Hervé Moulin 001; Fedor Sandomirskiy; Elena Yanovskaya (CoRR, 2016)

Dividing goods and bads under additive utilities. - Anna Bogomolnaia; Hervé Moulin 001; Fedor Sandomirskiy; Elena Yanovskaya (CoRR, 2016)

Entropy, desegregation, and proportional rationing. - Hervé Moulin 001 (J. Econ. Theory, 2016)

Foreword. - Hervé Moulin 001 (Handbook of Computational Social Choice, 2016)

Competitive division of a mixed manna. - Anna Bogomolnaia; Hervé Moulin 001; Fedor Sandomirskiy; Elena Yanovskaya (CoRR, 2017)

Consistent bilateral assignment. - Hervé Moulin 001 (Math. Soc. Sci., 2017)

A simple Online Fair Division problem. - Anna Bogomolnaia; Hervé Moulin 001; Fedor Sandomirskiy (CoRR, 2019)

Dividing bads under additive utilities. - Anna Bogomolnaia; Hervé Moulin 001; Fedor Sandomirskiy; Elena Yanovskaia (Soc. Choice Welf., 2019)

The Unreasonable Fairness of Maximum Nash Welfare. - Ioannis Caragiannis; David Kurokawa; Hervé Moulin 001; Ariel D. Procaccia; Nisarg Shah 001; Junxing Wang (ACM Trans. Economics and Comput., 2019)

A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation. - Haris Aziz 001; Hervé Moulin 001; Fedor Sandomirskiy (Oper. Res. Lett., 2020)

Fair Mixing: The Case of Dichotomous Preferences. - Haris Aziz 001; Anna Bogomolnaia; Hervé Moulin 001 (ACM Trans. Economics and Comput., 2020)

In memory of Victoria Kreps (3 September 1945-3 March 2021). - Anna Bogomolnaia; Misha Gavrilovich; Egor Ianovski; Galina Lyapunova; Hervé Moulin 001; Alexander S. Nesterov; Marina Sandomirskaia; Fedor Sandomirskiy; Elena Yanovskaya (Int. J. Game Theory, 2021)

Fair Division of Indivisible Goods: A Survey. - Georgios Amanatidis; Haris Aziz 001; Georgios Birmpas; Aris Filos-Ratsikas; Bo Li 037; Hervé Moulin 001; Alexandros A. Voudouris; Xiaowei Wu 001 (CoRR, 2022)

On the Fair Division of a Random Object. - Anna Bogomolnaia; Hervé Moulin 001; Fedor Sandomirskiy (Manag. Sci., 2022)

Algorithmic fair allocation of indivisible items: a survey and new questions. - Haris Aziz 001; Bo Li 037; Hervé Moulin 001; Xiaowei Wu 001 (SIGecom Exch., 2022)

Guarantees in Fair Division: General or Monotone Preferences. - Anna Bogomolnaia; Hervé Moulin 001 (Math. Oper. Res., 2023)

Fair division of indivisible goods: Recent progress and open questions. - Georgios Amanatidis; Haris Aziz 001; Georgios Birmpas; Aris Filos-Ratsikas; Bo Li 037; Hervé Moulin 001; Alexandros A. Voudouris; Xiaowei Wu 001 (Artif. Intell., 2023)

Almost proportional allocations of indivisible chores: Computation, approximation and efficiency. - Haris Aziz 001; Bo Li 037; Hervé Moulin 001; Xiaowei Wu 001; Xinran Zhu (Artif. Intell., 2024)

Guaranteed shares of benefits and costs. - Anna Bogomolnaia; Hervé Moulin 001 (CoRR, 2024)

Professor Peter Sudhölter (1957-2024). - Michel Grabisch; Hervé Moulin 001; José Manuel Zarzuelo (Int. J. Game Theory, 2024)

On Hill's Worst-Case Guarantee for Indivisible Bads. - Bo Li 037; Hervé Moulin 001; Ankang Sun; Yu Zhou 047 (ACM Trans. Economics and Comput., 2024)