Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols

@inproceedings{Lindner2009DegreesOG,
  title={Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols},
  author={C. Lindner and J. Rothe},
  booktitle={WINE},
  year={2009}
}
  • C. Lindner, J. Rothe
  • Published in WINE 2009
  • Computer Science, Mathematics
  • Fair allocation of goods or resources among various agents is a central task in multiagent systems and other fields. The specific setting where just one divisible resource is to be divided fairly is commonly referred to as cake-cutting, and agents are called players in this setting. Cake-cutting protocols aim at dividing a cake and assigning the resulting portions to several players in a way that each of the players, according to his or her valuation of these portions, feels to have received a… CONTINUE READING
    7 Citations
    A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents
    • Haris Aziz, S. Mackenzie
    • Mathematics, Computer Science
    • 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
    • 2016
    • 88
    • PDF
    Distributed fair allocation of indivisible goods
    • 26
    • PDF
    A discrete and bounded envy-free cake cutting protocol for four agents
    • 46
    • Highly Influenced
    • PDF
    13 Cake Cutting Algorithms
    • 1
    • PDF
    Computational Social Choice
    • 188
    • PDF
    Cake Cutting Algorithms
    • A. Procaccia
    • Computer Science
    • Handbook of Computational Social Choice
    • 2016
    • 97
    • PDF

    References

    SHOWING 1-10 OF 43 REFERENCES
    Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Procedure
    • 8
    • Highly Influential
    • PDF
    Games of Fair Division
    • 92
    AN ENVY-FREE CAKE DIVISION PROTOCOL
    • 214
    • PDF
    Fairness and Envy
    • 154
    Cake-Cutting Is Not a Piece of Cake
    • 35
    • PDF
    On the complexity of cake cutting
    • 56
    • PDF
    Envy-Free Cake Divisions Cannot be Found by Finite Protocols
    • 70
    • PDF
    A note on cake cutting
    • S. Even, A. Paz
    • Mathematics, Computer Science
    • Discret. Appl. Math.
    • 1984
    • 120
    • Highly Influential
    • PDF