SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Better Ways to Cut a Cake
12 references·0 citing·29 second hop
Better Ways to Cut a Cake (2006)Better Ways to Cut a CakeThe Geometry of Efficient Fair Division (2005)The Geometry of Efficient Fai…Efficient Fair Division (2005)Efficient Fair DivisionChapter 11 Utilitarianism and the theory of justice (2002)Chapter 11 Utilitarianism and…Bidding for envy-freeness: A procedural approach to n-player fair-division problems (2002)Bidding for envy-freeness: A …Cake-Cutting Algorithms: Be Fair if You Can. (2000)Cake-Cutting Algorithms: Be F…The Win-Win Solution: Guaranteeing Fair Shares to Everybody (1999)The Win-Win Solution: Guarant…Rental Harmony: Sperner's Lemma in Fair Division (1999)Rental Harmony: Sperner's Lem…Fair Division: From Cake-Cutting to Dispute Resolution. (1998)Fair Division: From Cake-Cutt…An Envy-Free Cake Division Protocol (1995)An Envy-Free Cake Division Pr…Interpersonal Comparisons of Well-Being (1991)Interpersonal Comparisons of …How to Cut a Cake Fairly (1980)How to Cut a Cake FairlyHow to Cut A Cake Fairly (1961)How to Cut A Cake FairlyThe problem of fair division (1948)Introduction to Computational Social Choice (2016)Fair Division (1996)Spliddit (2015)A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents (2016)Social Choice and Individual Values. (1951)Government spending and economic growth in Tanzania, 1965 - 1996 (2000)Chapter 10 Social welfare functionals and interpersonal comparability (2002)Efficiency with Endogenous Population Growth (2007)An Introduction to the Principles of Morals and Legislation (2017)Theory of games and economic behavior (2019)Applications Of Negotiation Theory To Water Issues (2005)Characterizing conflicts in fair division of indivisible goods using a scale of criteria (2015)Finding a Collective Set of Items: From Proportional Multirepresentation to Group Recommendation (2015)Mechanism design for fair division (2013)Approximating the Nash Social Welfare with Indivisible Items (2015)Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (2021)An Overview and Evaluation of Composite Indices of Development (2002)Libertarianism without Inequality (2003)HUMAN RIGHTS AND GLOBAL HEALTH: A RESEARCH PROGRAM (2005)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)Fair division: From cake-cutting to dispute resolution (1996)On approximately fair allocations of indivisible goods (2004)The Unreasonable Fairness of Maximum Nash Welfare (2016)Is It Good to Cooperate? Testing the Theory of Morality-as-Cooperation in 60 Societies (2019)
this work references cited by second hop

References

  • 1998Fair Division: From Cake-Cutting to Dispute Resolution.751 cited
  • 1991Interpersonal Comparisons of Well-Being570 cited
  • 1961How to Cut A Cake Fairly385 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
  • 1980How to Cut a Cake Fairly229 cited
  • 1999The Win-Win Solution: Guaranteeing Fair Shares to Everybody161 cited
  • 2002Chapter 11 Utilitarianism and the theory of justice144 cited
  • 2005The Geometry of Efficient Fair Division95 cited
  • 2005Efficient Fair Division91 cited
  • 2002Bidding for envy-freeness: A procedural approach to n-player fair-division problems87 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