SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Thou shalt covet thy neighbor's cake
6 references·1 citing·18 second hop
Thou shalt covet thy neighbor's cake (2009)Thou shalt covet thy neighbor's cakeEnvy-Free Cake Divisions Cannot be Found by Finite Protocols (2008)Envy-Free Cake Divisions Cann…Cake-Cutting Algorithms: Be Fair if You Can. (2000)Cake-Cutting Algorithms: Be F…An Envy-Free Cake Division Protocol (1995)An Envy-Free Cake Division Pr…A note on cake cutting (1984)A note on cake cuttingHow to Cut a Cake Fairly (1980)How to Cut a Cake FairlyThe problem of fair division (1948)The problem of fair divisionA discrete and bounded envy-free cake cutting protocol for four agents (2016)A discrete and bounded envy-f…Fair Division (1996)Fair Division: From Cake-Cutting to Dispute Resolution. (1998)Handbook of Computational Social Choice (2016)Constraints in fair division (2021)Sur la division pragmatique (1949)How to Cut A Cake Fairly (1961)Optimal Envy-Free Cake Cutting (2011)Algorithmic Solutions for Envy-Free Cake Cutting (2012)Approximation Algorithms for Computing Maximin Share Allocations (2017)Rental Harmony: Sperner's Lemma in Fair Division (1999)Fair Allocation Rules (2011)Truth, justice, and cake cutting (2012)The Efficiency of Fair Division (2011)Cake cutting (2013)Fair division: From cake-cutting to dispute resolution (1996)Introduction to Computational Social Choice (2016)Critical ratios and efficient allocation (1973)The Unreasonable Fairness of Maximum Nash Welfare (2016)
this work references cited by second hop

References

  • 1948The problem of fair division432 cited
  • 2000Cake-Cutting Algorithms: Be Fair if You Can.343 cited
  • 1995An Envy-Free Cake Division Protocol264 cited
  • 1980How to Cut a Cake Fairly229 cited
  • 1984A note on cake cutting136 cited
  • 2008Envy-Free Cake Divisions Cannot be Found by Finite Protocols92 cited

Cited by

  • 2016A discrete and bounded envy-free cake cutting protocol for four agents63 cited

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