Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Approximation Algorithms for Computing Maximin Share Allocations

15 references·11 citing·30 second hop

FromToDepth

this work references cited by second hop

References

2011The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes767 cited
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
2016The Unreasonable Fairness of Maximum Nash Welfare346 cited
2000Cake-Cutting Algorithms: Be Fair if You Can.343 cited
1996Fair division: From cake-cutting to dispute resolution249 cited
1998Cake-Cutting Algorithms226 cited
2005Allocating indivisible goods176 cited
2016Fair Allocation of Indivisible Goods170 cited
2014Fair enough138 cited
1984A note on cake cutting136 cited
2015Characterizing conflicts in fair division of indivisible goods using a scale of criteria134 cited
2016Cake Cutting Algorithms127 cited

Cited by

2018Fair Allocation of Indivisible Goods106 cited
2018

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

Approximating the Nash Social Welfare with Indivisible Items

99 cited

2019A Little Charity Guarantees Almost Envy-Freeness96 cited

2023Fair division of indivisible goods: Recent progress and open questions96 cited

2020EFX Exists for Three Agents89 cited

2016When Can the Maximin Share Guarantee Be Guaranteed?87 cited

2017Algorithms for Max-Min Share Fair Allocation of Indivisible Chores82 cited

2021Maximum Nash welfare and other stories about EFX74 cited

2019Envy-Freeness Up to Any Item with High Nash Welfare70 cited

2020An Improved Approximation Algorithm for Maximin Shares70 cited

2019Fair Allocation of Indivisible Goods to Asymmetric Agents70 cited