Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Approximating the Nash Social Welfare with Indivisible Items

11 references·7 citing·37 second hop

FromToDepth

this work references cited by second hop

References

1950The Bargaining Problem8,031 cited
1974Equity, envy, and efficiency1,027 cited
2011The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes767 cited
1979The Efficient Allocation of Individuals to Positions553 cited
2004On approximately fair allocations of indivisible goods537 cited
1959Consensus of Subjective Probabilities: The Pari-Mutuel Method419 cited
1979The Nash Social Welfare Function234 cited
2005Allocating indivisible goods176 cited
2014Fair enough138 cited
2015Characterizing conflicts in fair division of indivisible goods using a scale of criteria134 cited
2017Approximation Algorithms for Computing Maximin Share Allocations125 cited

Cited by

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
2021Maximum Nash welfare and other stories about EFX74 cited
2019Envy-Freeness Up to Any Item with High Nash Welfare

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

70 cited

2016A discrete and bounded envy-free cake cutting protocol for four agents63 cited

2020Fair Division with Binary Valuations: One Rule to Rule Them All63 cited