Logo
Munich Personal RePEc Archive

Browse by Authors

Group by: Date | Item ID
Number of items: 9.

January 2009

Brams, Steven J. and Kilgour, D. Marc and Klamler, Christian (2009): The undercut procedure: an algorithm for the envy-free division of indivisible items.

April 2010

Brams, Steven J. and Jones, Michael A. and Klamler, Christian (2010): Divide-and-conquer: A proportional, minimal-envy cake-cutting algorithm. Forthcoming in: SIAM Review (2011)

22 October 2011

Brams, Steven J. and Jones, Michael A. and Klamler, Christian (2011): N-Person cake-cutting: there may be no perfect division.

June 2013

Brams, Steven J. and Kilgour, D. Marc and Klamler, Christian (2013): Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm.

May 2014

Brams, Steven J. and Kilgour, D. Marc and Klamler, Christian (2014): An algorithm for the proportional division of indivisible items.

6 September 2014

Brams, Steven and Kilgour, D. Marc and Klamler, Christian (2014): How to divide things fairly.

22 March 2015

Brams, Steven and Kilgour, Marc and Klamler, Christian (2015): Maximin Envy-Free Division of Indivisible Items.

March 2021

Brams, Steven J. and Kilgour, D. Marc and Klamler, Christian (2021): Two-Person Fair Division of Indivisible Items when Envy-Freeness Is Impossible.

August 2021

Brams, Steven J. and Kilgour, Marc and Klamler, Christian (2021): Two-Person Fair Division of Indivisible Items: Compatible and Incompatible Properties.

This list was generated on Wed Dec 18 03:07:26 2024 CET.
Atom RSS 1.0 RSS 2.0

Contact us: mpra@ub.uni-muenchen.de

This repository has been built using EPrints software.

MPRA is a RePEc service hosted by Logo of the University Library LMU Munich.