Ray Chaudhury, Bhaskar Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Mehlhorn, Kurt Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Ray Chaudhury, B., Kavitha, T., Mehlhorn, K., & Sgouritsa, A. (2020). A Little Charity Guarantees Almost Envy-Freeness. In S. Chawla (Ed.), Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms (pp. 2658 -2672). Philadelphia, PA: SIAM. doi:10.1137/1.9781611975994.162.
