This project implements a polynomial time fair division algorithm for computing EFX allocations based on the paper by Caragiannis et al. (2019)[1]

Fair division problems (in the setting of indivisible resources) are about dividing a set of indivisible resources among a set of agents in ways that enforce some measure of fairness - based on the agents individual valuation of each of the resources.

[1] Ioannis Caragiannis, Nick Gravin, and Xin Huang. “Envy-Freeness Up to Any Item with High Nash Welfare: The Virtue of Donating Items”. In: Proceedings of the 2019 ACM Conference on Economics and Computation, EC 2019, Phoenix, AZ, USA, June 24-28, 2019. Ed. by Anna Karlin, Nicole Immorlica, and Ramesh Johari. ACM, 2019, pp. 527–545. doi: 10.1145/3328526.3329574. url: https://doi.org/10.1145/3328526.3329574.