On finding an envy-free Pareto-optimal division

@article{Reijnierse1998OnFA,
  title={On finding an envy-free Pareto-optimal division},
  author={Hans Reijnierse and Jos A. M. Potters},
  journal={Mathematical Programming},
  year={1998},
  volume={83},
  pages={291-311}
}
  • Hans Reijnierse, Jos A. M. Potters
  • Published 1998
  • Mathematics, Computer Science
  • Mathematical Programming
  • 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. 

    Topics from this paper.

    Optimal Envy-Free Cake Cutting
    • 76
    • PDF
    Fair Allocation Rules
    • 166
    • PDF
    On Maxsum Fair Cake Divisions
    • 42
    • PDF
    Fair Public Decision Making
    • 58
    • PDF
    Optimal Proportional Cake Cutting with Connected Pieces
    • 49
    • PDF
    Dynamic Multi-Agent Task Allocation with Spatial and Temporal Constraints
    • 39
    • PDF
    Envy-Free Cake-Cutting in Two Dimensions
    • 23
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-7 OF 7 REFERENCES
    Maximal Flow Through a Network
    • 2,502
    The theory of linear economic models
    • 745
    • Highly Influential
    An Envy-Free Cake Division Algorithm
    • 10
    Sur la division pragmatique
    • 87
    Sur le probl 6 me du partage pragmatique de H . Steinhaus
    • 1946
    Sur le probl6me du partage pragmatique de H. Steinhaus. Annales de la Soei&~ Polonaise de Mathematique
    • 1946
    The problem of fair division
    • 1948