The field of fair division and online resource allocation is rapidly advancing, with a focus on developing innovative algorithms and frameworks to address complex problems. Recent research has explored the fair division of indivisible chores and goods, online rounding schemes for rental problems, and personalized solutions to stable roommates problems. Additionally, there has been significant progress in generating satisfiable benchmark instances for stable roommates problems and developing algorithm-to-contract frameworks without demand queries. Noteworthy papers in this area include: Existence of 2-EFX Allocations of Chores, which improves the guarantee for allocations satisfying the fairness notion of envy-freeness up to any chore. Online Rounding Schemes for k-Rental Problems, which develops theoretically grounded relax-and-round algorithms with provable competitive-ratio guarantees. An Algorithm-to-Contract Framework without Demand Queries, which transforms algorithms for combinatorial problems to tackle incentive constraints in contract design.