SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A discrete and bounded envy-free cake cutting protocol for four agents
16 references·1 citing·26 second hop
A discrete and bounded envy-free cake cutting protocol for four agents (2016)A discrete and bounded envy-free cake cut…Approximating the Nash Social Welfare with Indivisible Items (2018)Approximating the Nash Social…Handbook of Computational Social Choice (2016)Handbook of Computational Soc…Cake Cutting Algorithms (2016)Cake Cutting AlgorithmsApproximating the Nash Social Welfare with Indivisible Items (2015)Approximating the Nash Social…Cake cutting (2013)Cake cuttingTruth, justice, and cake cutting (2012)Truth, justice, and cake cutt…Thou 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…The Geometry of Efficient Fair Division (2005)The Geometry of Efficient Fai…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…Fair Division: From Cake-Cutting to Dispute Resolution. (1998)Fair Division: From Cake-Cutt…A moving-knife solution to the four-person envy-free cake-division problem (1997)A moving-knife solution to th…Fair Division (1996)Fair DivisionAn Envy-Free Cake Division Protocol (1995)An Envy-Free Cake Division Pr…The problem of fair division (1948)The problem of fair divisionConstraints in fair division (2021)Constraints in fair divisionBeyond dominant resource fairness (2012)No Agent Left Behind: Dynamic Fair Division of Multiple Resources (2014)Approximation Algorithms for Computing Maximin Share Allocations (2017)Maximum Nash welfare and other stories about EFX (2021)Fair division of indivisible goods: Recent progress and open questions (2023)Resource allocation and the public sector (1967)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)A New Solution to the Random Assignment Problem (2001)Algorithmic Mechanism Design (2001)On the Rationale of Group Decision-making (1948)Social Choice and Individual Values. (1951)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)Twenty Lectures on Algorithmic Game Theory (2016)Fair Public Decision Making (2017)Social choice ethics in artificial intelligence (2017)Fair Allocation Rules (2011)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)Critical ratios and efficient allocation (1973)
this work references cited by second hop

References

  • 1998Fair Division: From Cake-Cutting to Dispute Resolution.751 cited
  • 1996Fair Division670 cited
  • 2016Handbook of Computational Social Choice466 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
  • 2016Cake Cutting Algorithms127 cited
  • 2018Approximating the Nash Social Welfare with Indivisible Items99 cited
  • 2005The Geometry of Efficient Fair Division95 cited
  • 2008Envy-Free Cake Divisions Cannot be Found by Finite Protocols92 cited
  • 2015Approximating the Nash Social Welfare with Indivisible Items76 cited
  • 2009Thou shalt covet thy neighbor's cake71 cited
  • 1997A moving-knife solution to the four-person envy-free cake-division problem64 cited

Cited by

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

2021
Constraints in fair division
61 cited