Comparative study in fair division algorithms
Liad Nagi, Moriya Elgrabli

TL;DR
This paper compares four fair division algorithms using real data, evaluating their performance based on total utility and the minimum utility received by any agent.
Contribution
It provides a comparative analysis of multiple fair division algorithms on real-world data, highlighting their relative effectiveness.
Findings
Algorithms differ significantly in utility outcomes.
Some algorithms achieve higher total utility.
Others better ensure fairness for all agents.
Abstract
A comparison of four fair division algorithms performed on real data from the spliddit website. The comparison was made on the sum of agent's utilities, and the minimum utility for an agent in an allocation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Auction Theory and Applications · Optimization and Search Problems
