Hervé Moulin

Math. Oper. Res., February, 2023

On Hill's Worst-Case Guarantee for Indivisible Bads.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Algorithmic fair allocation of indivisible items: a survey and new questions.

[BibT_eX]

[DOI]

SIGecom Exch., July, 2022

On the Fair Division of a Random Object.

[BibT_eX]

[DOI]

Manag. Sci., 2022

Fair Division of Indivisible Goods: A Survey.

[BibT_eX]

[DOI]

Alexandros A. Voudouris

Xiaowei Wu

CoRR, 2022

2021

In memory of Victoria Kreps (3 September 1945-3 March 2021).

[BibT_eX]

[DOI]

Alexander S. Nesterov

Marina Sandomirskaia

Elena Yanovskaya

Int. J. Game Theory, 2021

2020

Fair Mixing: The Case of Dichotomous Preferences.

[BibT_eX]

[DOI]

Haris Aziz

ACM Trans. Economics and Comput., 2020

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

[BibT_eX]

[DOI]

Haris Aziz

Oper. Res. Lett., 2020

2019

The Unreasonable Fairness of Maximum Nash Welfare.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2019

Dividing bads under additive utilities.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2019

A simple Online Fair Division problem.

[BibT_eX]

[DOI]

CoRR, 2019

2017

Consistent bilateral assignment.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2017

Competitive division of a mixed manna.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Foreword.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Computational Social Choice, 2016

Entropy, desegregation, and proportional rationing.

[BibT_eX]

[DOI]

J. Econ. Theory, 2016

Dividing goods and bads under additive utilities.

[BibT_eX]

[DOI]

CoRR, 2016

Dividing goods or bads under additive utilities.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Size versus fairness in the assignment problem.

[BibT_eX]

[DOI]

Games Econ. Behav., 2015

2014

Improving Nash by coarse correlation.

[BibT_eX]

[DOI]

Indrajit Ray

Sonali Sen Gupta

J. Econ. Theory, 2014

Pricing traffic in a spanning network.

[BibT_eX]

[DOI]

Games Econ. Behav., 2014

Sharing the cost of redundant items.

[BibT_eX]

[DOI]

Jens Leth Hougaard

Games Econ. Behav., 2014

2013

Egalitarianism under earmark constraints.

[BibT_eX]

[DOI]

Olivier Bochet

Rahmi Ilkiliç

J. Econ. Theory, 2013

The Bipartite Rationing Problem.

[BibT_eX]

[DOI]

Jay Sethuraman

Oper. Res., 2013

Cost Sharing in Networks: some Open Questions.

[BibT_eX]

[DOI]

IGTR, 2013

The price of imperfect competition for a spanning network.

[BibT_eX]

[DOI]

Rodrigo A. Velez

Games Econ. Behav., 2013

Loss calibrated methods for bipartite rationing: bipartite rationing.

[BibT_eX]

[DOI]

Jay Sethuraman

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012

Rationing problems in bipartite networks.

[BibT_eX]

[DOI]

Jay Sethuraman

SIGecom Exch., 2012

2011

Equal-need sharing of a network under connectivity constraints.

[BibT_eX]

[DOI]

Francois Laigret

Games Econ. Behav., 2011

2010

Auctioning or assigning an object: some remarkable VCG mechanisms.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2010

Sharing the Cost of a Capacity Network.

[BibT_eX]

[DOI]

Ron Holzman

Math. Oper. Res., 2010

Bargaining among groups: an axiomatic viewpoint.

[BibT_eX]

[DOI]

Suchan Chae

Int. J. Game Theory, 2010

An efficient and almost budget balanced cost sharing method.

[BibT_eX]

[DOI]

Games Econ. Behav., 2010

Sharing a minimal cost spanning tree: Beyond the Folk solution.

[BibT_eX]

[DOI]

Games Econ. Behav., 2010

Clearing supply and demand under bilateral constraints.

[BibT_eX]

[DOI]

Olivier Bochet

Rahmi Ilkiliç

Proceedings of the Behavioral and Quantitative Game Theory, 2010

2009

Almost budget-balanced VCG mechanisms to assign multiple objects.

[BibT_eX]

[DOI]

J. Econ. Theory, 2009

2008

A Combinatorial Inequality: 11269.

[BibT_eX]

[DOI]

Am. Math. Mon., 2008

Impartial division of a dollar.

[BibT_eX]

[DOI]

Geoffroy de Clippel

T. Nicolaus Tideman

J. Econ. Theory, 2008

Proportional scheduling, split-proofness, and merge-proofness.

[BibT_eX]

[DOI]

Games Econ. Behav., 2008

An advocate of cooperative theory.

[BibT_eX]

[DOI]

Games Econ. Behav., 2008

2007

Problem 11269.

[BibT_eX]

[DOI]

Am. Math. Mon., 2007

On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs.

[BibT_eX]

[DOI]

Math. Oper. Res., 2007

Minimizing the Worst Slowdown: Offline, Online.

[BibT_eX]

[DOI]

Oper. Res., 2007

Efficient cost sharing with a cheap residual claimant.

[BibT_eX]

[DOI]

Proceedings of the Fair Division, 24.06. - 29.06.2007, 2007

Strategy-proof assignment with a vanishing budget surplus.

[BibT_eX]

[DOI]

Proceedings of the Computational Social Systems and the Internet, 1.7. - 6.7.2007, 2007

2006

Responsibility and cross-subsidization in cost sharing.

[BibT_eX]

[DOI]

Yves Sprumont

Games Econ. Behav., 2006

2005

On demand responsiveness in additive cost sharing.

[BibT_eX]

[DOI]

Yves Sprumont

J. Econ. Theory, 2005

Collective choice under dichotomous preferences.

[BibT_eX]

[DOI]

Richard Stong

J. Econ. Theory, 2005

2003

Filling a multicolor urn: an axiomatic analysis.

[BibT_eX]

[DOI]

Richard Stong

Games Econ. Behav., 2003

Fair division and collective welfare.

[BibT_eX]

MIT Press, ISBN: 978-0-262-63311-6, 2003

2002

The proportional random allocation of indivisible units.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2002

Fair Queuing and Other Probabilistic Allocation Methods.

[BibT_eX]

[DOI]

Richard Stong

Math. Oper. Res., 2002

2001

A New Solution to the Random Assignment Problem.

[BibT_eX]

[DOI]

J. Econ. Theory, 2001

Scheduling with Opting Out: Improving upon Random Priority.

[BibT_eX]

[DOI]

Hervé Crès

Oper. Res., 2001

1982

Non-cooperative implementation: A survey of recent results.

[BibT_eX]

[DOI]

Math. Soc. Sci., 1982

1976

Cooperation in Mixed Equilibrium.

[BibT_eX]

[DOI]