Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

11 references·10 citing·24 second hop

FromToDepth

this work references cited by second hop

References

1953Stochastic Games2,447 cited
2003Fair Division and Collective Welfare815 cited
1998Fair Division: From Cake-Cutting to Dispute Resolution.751 cited
1996Fair Division670 cited
1948The problem of fair division432 cited
2000Cake-Cutting Algorithms: Be Fair if You Can.343 cited
1999Rental Harmony: Sperner's Lemma in Fair Division309 cited
2013Designing Random Allocation Mechanisms: Theory and Applications304 cited
1998Cake-Cutting Algorithms226 cited
2013Cake cutting156 cited
2014Fair enough138 cited

Cited by

2018Fair Enough125 cited
2017Approximation Algorithms for Maximin Fair Division104 cited
2021Fair algorithms for selecting citizens’ assemblies99 cited
2019A Little Charity Guarantees Almost Envy-Freeness96 cited
2019Fair Division in the Internet Age92 cited
2020EFX Exists for Three Agents89 cited

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

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

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

2020Approximation Algorithms for Maximin Fair Division74 cited

2020Fairness and Decision-making in Collaborative Shift Scheduling Systems64 cited