The fair division of indivisible goods is a central problem in social choice theory, with Envy-Freeness up to any Good (EFX) serving as a critical relaxation of envy-freeness. While the existence of Envy-Free up to one Good (EF1) is well-established, the existence of EFX allocations for more than three agents remains a significant open problem. This difficulty motivates the study of EFX with charity, a relaxation where a subset of items remains unallocated to ensure the remaining distribution satisfies the EFX property. This talk focuses on the definition of EFX with charity and the constructive proof of its existence for general monotone valuations. We specifically present a pseudo-polynomial time algorithm that computes an allocation where no agent envies the unallocated pool and the number of unallocated items is strictly bounded by $n-1$.
