Skip to main content
SpringerLink
Log in

On finding an envy-free Pareto-optimal division

  • Published:
Mathematical Programming Submit manuscript

Abstract

This paper describes an algorithm to find an (α-)envy-free Pareto-optimal division in the case of a finite number of homogeneous infinitely divisible goods and linear utility functions. It is used to find an allocation in the classical cake division problem that is almost Pareto-optimal and α-envy-free.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Brams, S., Taylor, A., 1992. An envy free cake division algorithm, Mimeo, Department of Politics, New York University, New York.

    Google Scholar 

  • Ford, L., Fulkerson, D., 1956. Maximal flow through a network. Canadian Journal of Mathematics 8, 399–404.

    MATH  MathSciNet  Google Scholar 

  • Gale, D., 1960. The theory of linear economic models. McGraw-Hill, New York, pp. 281–287.

    Google Scholar 

  • Knaster, B., 1946. Sur le problème du partage pragmatique de H. Steinhaus. Annales de la Société Polonaise de Mathematique 19, 228–230.

    MathSciNet  Google Scholar 

  • Steinhaus, H., 1948. The problem of fair division. Econometrica 16, 101–104.

    Google Scholar 

  • Steinhaus, H., 1949. Sur la division pragmatique. Econometrica 17 (suppl.), 315–319.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Nijmegen, Toernooiveld, 6525 ED, Nijmegen, The Netherlands

    J. H. Reijnierse & J. A. M. Potters

Authors
  1. J. H. Reijnierse
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. A. M. Potters
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Reijnierse, J.H., Potters, J.A.M. On finding an envy-free Pareto-optimal division. Mathematical Programming 83, 291–311 (1998). https://doi.org/10.1007/BF02680564

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02680564

Keywords

Search

Navigation