Fair Allocation Algorithm Optimized For Envy-Freeness
Researchers have optimized the Envy Cycle Elimination Algorithm. The work focuses on the fair allocation of indivisible goods, using the envy-freeness up to one good (EF1) notion. This is a classical approach to computation.
Topics
Developing
- 882d Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore.
- 882d Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur.
- 882d Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est.
- 882d Sed ut perspiciatis unde omnis iste natus error sit voluptatem accusantium doloremque laudantium.
Sources · 7 independent
Modernity/arxiv
“Optimizing the Envy Cycle Elimination Algorithm. Authors: Karen Frilya Celine, Warut Suksompong Abstract: In the fair allocation of indivisible goods, a widely used notion of fairness is envy-freeness up to one good (EF1). A classical way to comput...”
Unlock the full story
Get a Pro subscription or above to see the live story progression and the full list of independent sources confirming each event as they happen.
Log in to upgrade