Approximation Algorithms for Maximin Fair Division

@inproceedings{Barman2017ApproximationAF,
  title={Approximation Algorithms for Maximin Fair Division},
  author={Siddharth Barman and Sanath Kumar Krishna Murthy},
  booktitle={EC},
  year={2017}
}
We consider the problem of dividing indivisible goods fairly among n agents who have additive and submodular valuations for the goods. Our fairness guarantees are in terms of the maximin share, that is defined to be the maximum value that an agent can ensure for herself, if she were to partition the goods into n bundles, and then receive a minimum valued bundle. Since maximin fair allocations (i.e., allocations in which each agent gets at least her maximin share) do not always exist, prior work… CONTINUE READING
12 Citations
8 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 12 extracted citations

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Characterizing conƒicts in fair division of indivisible goods using a scale of criteria

  • Sylvain Bouveret, Michel Lemaı̂tre
  • Autonomous Agents and Multi-Agent Systems 30,
  • 2016
Highly Influential
8 Excerpts

Eciency and Sequenceability in Fair Division of Indivisible Goods with Additive Preferences

  • Sylvain Bouveret, Michel Lematre
  • In Proceedings of the Sixth International…
  • 2016
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…