SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Bidding for envy-freeness: A procedural approach to n-player fair-division problems
7 references·3 citing·28 second hop
Bidding for envy-freeness: A procedural approach to n-player fair-division problems (2002)Bidding for envy-freeness: A procedural a…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…No-Envy and Consistency in Economies with Indivisible Goods (1991)No-Envy and Consistency in Ec…Fair Allocation of Indivisible Goods and Criteria of Justice (1991)Fair Allocation of Indivisibl…Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness (1983)Large Indivisibles: An Analys…Resource allocation and the public sector (1967)Resource allocation and the p…The problem of fair division (1948)The problem of fair divisionBetter Ways to Cut a Cake (2006)Better Ways to Cut a CakeConsensus-halving via theorems of Borsuk-Ulam and Tucker (2003)Consensus-halving via theorem…An algorithm for envy-free allocations in an economy with indivisible objects and money (2000)An algorithm for envy-free al…The assignment game I: The core (1971)Equity, envy, and efficiency (1974)On fair compensation (1994)A characterization of the Shapley value in queueing problems (2003)Fair Income Tax (2006)Game theoretic analysis of a bankruptcy problem from the Talmud (1985)Population-monotonic solutions to the problem of fair division when preferences are single-peaked (1995)FAIR DIVISION OF INDIVISIBLE ITEMS (2003)Consistency and its converse: an introduction (2011)Fair Division (1996)Cake-Cutting Algorithms: Be Fair if You Can. (2000)Fair Allocation Rules (2011)Spliddit (2015)A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents (2016)Theory of Value (1959)General competitive analysis (1971)On the fair division of a heterogeneous commodity (1992)Queue allocation of indivisible goods (1994)How to Cut A Cake Fairly (1961)Interpersonal Comparisons of Well-Being (1991)Competitive Fair Division (2001)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)2. Public Goods: A Survey of Experimental Research (1995)Equality of Opportunity (1998)Critical ratios and efficient allocation (1973)An Envy-Free Cake Division Protocol (1995)
this work references cited by second hop

References

  • 1967Resource allocation and the public sector1,086 cited
  • 1998Fair Division: From Cake-Cutting to Dispute Resolution.751 cited
  • 1948The problem of fair division432 cited
  • 1999Rental Harmony: Sperner's Lemma in Fair Division309 cited
  • 1991Fair Allocation of Indivisible Goods and Criteria of Justice242 cited
  • 1983Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness209 cited
  • 1991No-Envy and Consistency in Economies with Indivisible Goods103 cited

Cited by

  • 2006Better Ways to Cut a Cake76 cited
  • 2000An algorithm for envy-free allocations in an economy with indivisible objects and money75 cited
  • 2003Consensus-halving via theorems of Borsuk-Ulam and Tucker67 cited

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