SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
On Allocating Goods to Maximize Fairness
4 references·5 citing·28 second hop
On Allocating Goods to Maximize Fairness (2009)On Allocating Goods to Maximize FairnessAllocating indivisible goods (2005)Allocating indivisible goodsOn approximately fair allocations of indivisible goods (2004)On approximately fair allocat…Fair Division: From Cake-Cutting to Dispute Resolution. (1998)Fair Division: From Cake-Cutt…Fair Division (1996)Fair DivisionApproximation Algorithms for Maximin Fair Division (2020)Approximation Algorithms for …A flexible method for optimising sharing of healthcare resources and demand in the context of the COVID-19 pandemic (2020)A flexible method for optimis…Approximation Algorithms for Maximin Fair Division (2017)Approximation Algorithms for …An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods (2010)An Approximation Algorithm fo…MaxMin allocation via degree lower-bounded arborescences (2009)MaxMin allocation via degree …The problem of fair division (1948)The Efficiency of Fair Division (2011)Approximate Mechanism Design without Money (2013)Fair enough (2014)Cake-Cutting Algorithms: Be Fair if You Can. (2000)Approximating the Nash Social Welfare with Indivisible Items (2015)Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (2021)Resource allocation and the public sector (1967)Equity, envy, and efficiency (1974)A Short Introduction to Computational Social Choice (2007)Almost Envy-Freeness with General Valuations (2018)An approximation algorithm for max-min fair allocation of indivisible goods (2007)On allocations that maximize fairness (2008)APX-hardness of maximizing Nash social welfare with indivisible items (2017)Fair Division and Collective Welfare (2003)The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes (2011)A Little Charity Guarantees Almost Envy-Freeness (2019)Fair Allocation of Indivisible Goods and Chores (2019)EFX Exists for Three Agents (2020)On cores and indivisibility (1974)Fair allocation of indivisible goods and chores (2021)Maximum Nash welfare and other stories about EFX (2021)Algorithmic Game Theory (2007)Algorithmic Game Theory: Computing in Games (2007)Algorithmic Game Theory: Quantifying the Inefficiency of Equilibria (2007)The Unreasonable Fairness of Maximum Nash Welfare (2016)Is It Good to Cooperate? Testing the Theory of Morality-as-Cooperation in 60 Societies (2019)Rental Harmony: Sperner's Lemma in Fair Division (1999)
this work references cited by second hop

References

  • 1998Fair Division: From Cake-Cutting to Dispute Resolution.751 cited
  • 1996Fair Division670 cited
  • 2004On approximately fair allocations of indivisible goods537 cited
  • 2005Allocating indivisible goods176 cited

Cited by

  • 2017Approximation Algorithms for Maximin Fair Division104 cited
  • 2010An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods86 cited
  • 2009MaxMin allocation via degree lower-bounded arborescences79 cited
  • 2020Approximation Algorithms for Maximin Fair Division74 cited
  • 2020A flexible method for optimising sharing of healthcare resources and demand in the context of the COVID-19 pandemic37 cited

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