The field of mechanism design and fair division is witnessing significant developments, with a focus on designing innovative solutions for complex problems. Researchers are exploring new approaches to achieve fairness, truthfulness, and efficiency in various settings, including graph-based models, geometric analyses, and multidimensional budget-feasible mechanisms. Notably, recent studies have made progress in resolving envy, allocating goods, and procuring items of maximum value. The introduction of new benchmarks and approximation guarantees has also enabled meaningful comparisons of mechanisms. Some noteworthy papers in this regard include: The paper On Approximate MMS Allocations on Restricted Graph Classes, which shows the existence of approximate allocations for several well-studied graph classes. The paper Multidimensional Budget-Feasible Mechanism Design, which obtains the first approximation guarantees for multidimensional budget feasible mechanism design.