Corpus ID: 291694

Greedy Algorithms for Maximizing Nash Social Welfare

@inproceedings{Barman2018GreedyAF,
  title={Greedy Algorithms for Maximizing Nash Social Welfare},
  author={Siddharth Barman and Sanath Kumar Krishna Murthy and Rohit Vaish},
  booktitle={AAMAS},
  year={2018}
}
  • Siddharth Barman, Sanath Kumar Krishna Murthy, Rohit Vaish
  • Published in AAMAS 2018
  • Computer Science, Mathematics
  • We study the problem of fairly allocating a set of indivisible goods among agents with additive valuations. The extent of fairness of an allocation is measured by its Nash social welfare, which is the geometric mean of the valuations of the agents for their bundles. While the problem of maximizing Nash social welfare is known to be APX-hard in general, we study the effectiveness of simple, greedy algorithms in solving this problem in two interesting special cases. First, we show that a simple… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 16 CITATIONS

    Greedy Algorithms for Fair Division of Mixed Manna

    VIEW 13 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Group Fairness for the Allocation of Indivisible Goods

    VIEW 8 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Fairness and Diversity in Public Resource Allocation Problems

    VIEW 1 EXCERPT
    CITES METHODS

    Almost Envy Freeness and Welfare Efficiency in Fair Division with Goods or Bads

    VIEW 8 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 23 REFERENCES

    Approximating the Nash Social Welfare with Indivisible Items

    VIEW 2 EXCERPTS
    HIGHLY INFLUENTIAL

    Convex Program Duality, Fisher Markets, and Nash Social Welfare

    VIEW 1 EXCERPT