SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
How to Cut a Cake Before the Party Ends
14 references·0 citing·29 second hop
How to Cut a Cake Before the Party Ends (2013)How to Cut a Cake Before the Party EndsOptimal Proportional Cake Cutting with Connected Pieces (2021)Optimal Proportional Cake Cut…Cake cutting (2013)Cake cuttingTruth, justice, and cake cutting (2012)Truth, justice, and cake cutt…Fair allocation without trade (2012)Fair allocation without tradeOptimal Envy-Free Cake Cutting (2011)Optimal Envy-Free Cake CuttingThou shalt covet thy neighbor's cake (2009)Thou shalt covet thy neighbor…Envy-Free Cake Divisions Cannot be Found by Finite Protocols (2008)Envy-Free Cake Divisions Cann…On the complexity of cake cutting (2006)On the complexity of cake cut…Cake cutting really is not a piece of cake (2006)Cake cutting really is not a …On approximately fair allocations of indivisible goods (2004)On approximately fair allocat…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…The problem of fair division (1948)The problem of fair divisionAggregation of Utility Functions (1961)Interpersonal comparisons of utility: Why and how they are and should be made (1991)Existence of an equilibrium for a competitive economy (2008)Mechanism design for fair division (2013)Strategyproof allocation of discrete jobs on multiple machines (2014)Beyond Dominant Resource Fairness (2015)Resource allocation and the public sector (1967)Fair Division: From Cake-Cutting to Dispute Resolution. (1998)Fair Division and Collective Welfare (2003)Fair enough (2014)Spliddit (2015)A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents (2016)How to Cut A Cake Fairly (1961)Fair division: From cake-cutting to dispute resolution (1996)Introduction to Computational Social Choice (2016)Equity, envy, and efficiency (1974)A Short Introduction to Computational Social Choice (2007)The Unreasonable Fairness of Maximum Nash Welfare (2016)Almost Envy-Freeness with General Valuations (2018)Fair Division (1996)A New Solution to the Random Assignment Problem (2001)Algorithmic Mechanism Design (2001)Society-in-the-loop: programming the algorithmic social contract (2017)Fair Allocation Rules (2011)When Can the Maximin Share Guarantee Be Guaranteed? (2016)Fair Allocation of Indivisible Goods to Asymmetric Agents (2019)Some Experimental Games (1958)An experimental analysis of ultimatum bargaining (1982)A discrete and bounded envy-free cake cutting protocol for four agents (2016)
this work references cited by second hop

References

  • 2004On approximately fair allocations of indivisible goods537 cited
  • 1948The problem of fair division432 cited
  • 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
  • 2012Truth, justice, and cake cutting187 cited
  • 2013Cake cutting156 cited
  • 2012Fair allocation without trade97 cited
  • 2008Envy-Free Cake Divisions Cannot be Found by Finite Protocols92 cited
  • 2011Optimal Envy-Free Cake Cutting91 cited
  • 2009Thou shalt covet thy neighbor's cake71 cited
  • 2021Optimal Proportional Cake Cutting with Connected Pieces66 cited
  • 2006On the complexity of cake cutting65 cited
  • 2006Cake cutting really is not a piece of cake58 cited

Cited by

No citing works inside the corpus for this window.

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