SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
MaxMin allocation via degree lower-bounded arborescences
4 references·1 citing·15 second hop
MaxMin allocation via degree lower-bounded arborescences (2009)MaxMin allocation via degree lower-bounde…On Allocating Goods to Maximize Fairness (2009)On Allocating Goods to Maximi…On allocations that maximize fairness (2008)On allocations that maximize …An approximation algorithm for max-min fair allocation of indivisible goods (2007)An approximation algorithm fo…Allocating indivisible goods (2005)Allocating indivisible goodsAPX-hardness of maximizing Nash social welfare with indivisible items (2017)APX-hardness of maximizing Na…Fair Division (1996)Fair Division: From Cake-Cutting to Dispute Resolution. (1998)On approximately fair allocations of indivisible goods (2004)An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods (2010)When Can the Maximin Share Guarantee Be Guaranteed? (2016)The problem of fair division (1948)The Efficiency of Fair Division (2011)Approximate Mechanism Design without Money (2013)Fair enough (2014)Santa claus meets hypergraph matchings (2012)Approximating the Nash Social Welfare with Indivisible Items (2015)Approximation Algorithms for Maximin Fair Division (2020)Approximation Algorithms for Maximin Fair Division (2017)Envy-Freeness Up to Any Item with High Nash Welfare (2019)Maximum Nash welfare and other stories about EFX (2021)
this work references cited by second hop

References

  • 2005Allocating indivisible goods176 cited
  • 2009On Allocating Goods to Maximize Fairness114 cited
  • 2007An approximation algorithm for max-min fair allocation of indivisible goods102 cited
  • 2008On allocations that maximize fairness80 cited

Cited by

  • 2017APX-hardness of maximizing Nash social welfare with indivisible items78 cited

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