Indivisible Good

Fair division of indivisible goods is a challenging problem focusing on allocating items among agents with diverse preferences while ensuring fairness and efficiency. Current research explores various fairness criteria (e.g., envy-freeness, proportionality) and develops algorithms, often based on adaptations of multi-armed bandits or sequential allocation mechanisms like Yankee Swap, to achieve these goals under different valuation models (e.g., additive, submodular). These advancements have implications for resource allocation in diverse settings, including participatory budgeting and the division of land or other limited resources, by providing computationally tractable methods for fair and efficient distribution. The ongoing work emphasizes the trade-offs between different fairness notions and computational complexity, seeking to find practical solutions for real-world applications.