Maximin Shares with Lower Quotas
Researchers develop a method to fairly split items when everyone must get a minimum share.
Deep Dive
Computer scientists have created new algorithms for fairly dividing items among people when each person must receive a minimum and maximum number of items. For goods, they guarantee each person gets at least a fraction of their fair share, and for chores, they limit the burden. The algorithms work even when items are in different categories with separate limits, extending previous work that only handled maximum limits.
Why It Matters
This makes fair allocation practical for real-world problems like assigning tasks or distributing computing resources.