SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
On Maxsum Fair Cake Divisions
9 references·1 citing·32 second hop
On Maxsum Fair Cake Divisions (2021)On Maxsum Fair Cake DivisionsOptimal Proportional Cake Cutting with Connected Pieces (2021)Optimal Proportional Cake Cut…Truth, justice, and cake cutting (2012)Truth, justice, and cake cutt…Optimal Envy-Free Cake Cutting (2011)Optimal Envy-Free Cake CuttingThou shalt covet thy neighbor's cake (2009)Thou shalt covet thy neighbor…Combinatorial Algorithms for Market Equilibria (2007)Combinatorial Algorithms for …Cake-Cutting Algorithms: Be Fair if You Can. (2000)Cake-Cutting Algorithms: Be F…Fair Division: From Cake-Cutting to Dispute Resolution. (1998)Fair Division: From Cake-Cutt…Fair division: From cake-cutting to dispute resolution (1996)Fair division: From cake-cutt…Fair division from cake-cutting to dispute resolution (1996)Fair division from cake-cutti…Equitable Allocations of Indivisible Goods (2019)Equitable Allocations of Indi…The problem of fair division (1948)The Art and Science of Negotiation (1983)The Art and Science of Negotiation. (1984)Fair Allocation Rules (2011)Towards a Genuine Economic and Monetary Union (2016)An Envy-Free Cake Division Protocol (1995)How to Cut a Cake Before the Party Ends (2013)No agent left behind: dynamic fair division of multiple resources (2013)A discrete and bounded envy-free cake cutting protocol for four agents (2016)On approximately fair allocations of indivisible goods (2004)The Computational Rise and Fall of Fairness (2014)When Can the Maximin Share Guarantee Be Guaranteed? (2016)Fair Allocation of Indivisible Goods to Asymmetric Agents (2019)A New Solution to the Random Assignment Problem (2001)Algorithmic Mechanism Design (2001)Cake cutting (2013)A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents (2016)Society-in-the-loop: programming the algorithmic social contract (2017)How to Cut A Cake Fairly (1961)Pareto-Optimal Allocation of Indivisible Goods with Connectivity Constraints (2019)Consensus of Subjective Probabilities: The Pari-Mutuel Method (1959)On the complexity of equilibria (2002)Existence of an equilibrium for a competitive economy (2008)Finding approximate competitive equilibria: efficient and fair course allocation (2010)Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations (2014)Truthful Aggregation of Budget Proposals (2019)Resource allocation and the public sector (1967)The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes (2011)Rental Harmony: Sperner's Lemma in Fair Division (1999)The sound of silence in prisoner's dilemma and dictator games (1999)Is It Good to Cooperate? Testing the Theory of Morality-as-Cooperation in 60 Societies (2019)Knowledge, Fairness, and Social Constraints (2018)
this work references cited by second hop

References

  • 1998Fair Division: From Cake-Cutting to Dispute Resolution.751 cited
  • 2000Cake-Cutting Algorithms: Be Fair if You Can.343 cited
  • 1996Fair division: From cake-cutting to dispute resolution249 cited
  • 2012Truth, justice, and cake cutting187 cited
  • 2011Optimal Envy-Free Cake Cutting91 cited
  • 2009Thou shalt covet thy neighbor's cake71 cited
  • 1996Fair division from cake-cutting to dispute resolution70 cited
  • 2007Combinatorial Algorithms for Market Equilibria68 cited
  • 2021Optimal Proportional Cake Cutting with Connected Pieces66 cited

Cited by

  • 2019Equitable Allocations of Indivisible Goods50 cited

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