SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Envy-Free Cake Divisions Cannot be Found by Finite Protocols
4 references·4 citing·19 second hop
Envy-Free Cake Divisions Cannot be Found by Finite Protocols (2008)Envy-Free Cake Divisions Cannot be Found …Cake-Cutting Algorithms: Be Fair if You Can. (2000)Cake-Cutting Algorithms: Be F…Rental Harmony: Sperner's Lemma in Fair Division (1999)Rental Harmony: Sperner's Lem…An Envy-Free Cake Division Protocol (1995)An Envy-Free Cake Division Pr…How to Cut a Cake Fairly (1980)How to Cut a Cake FairlyConstraints in fair division (2021)Constraints in fair divisionA discrete and bounded envy-free cake cutting protocol for four agents (2016)A discrete and bounded envy-f…Optimal Envy-Free Cake Cutting (2011)Optimal Envy-Free Cake CuttingThou shalt covet thy neighbor's cake (2009)Thou shalt covet thy neighbor…The problem of fair division (1948)Fair Division (1996)Fair Division: From Cake-Cutting to Dispute Resolution. (1998)Handbook of Computational Social Choice (2016)How to Cut A Cake Fairly (1961)Fair division: From cake-cutting to dispute resolution (1996)Introduction to Computational Social Choice (2016)On approximately fair allocations of indivisible goods (2004)Mechanism design for fair division (2013)When Can the Maximin Share Guarantee Be Guaranteed? (2016)Fair Allocation of Indivisible Goods to Asymmetric Agents (2019)Fair Division and Collective Welfare (2003)Fair Allocation Rules (2011)Truth, justice, and cake cutting (2012)A note on cake cutting (1984)The Efficiency of Fair Division (2011)Cake cutting (2013)Spliddit (2015)A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents (2016)
this work references cited by second hop

References

  • 2000Cake-Cutting Algorithms: Be Fair if You Can.343 cited
  • 1999Rental Harmony: Sperner's Lemma in Fair Division309 cited
  • 1995An Envy-Free Cake Division Protocol264 cited
  • 1980How to Cut a Cake Fairly229 cited

Cited by

  • 2011Optimal Envy-Free Cake Cutting91 cited
  • 2009Thou shalt covet thy neighbor's cake71 cited
  • 2016A discrete and bounded envy-free cake cutting protocol for four agents63 cited
  • 2021Constraints in fair division61 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work