Learning Fair and Preferable Allocations through Neural Network
Ryota Maruo, Koh Takeuchi, Hisashi Kashima

TL;DR
This paper introduces a neural network-based approach to learn fair resource allocation mechanisms, specifically EF1, from examples, outperforming traditional methods in accuracy and fairness.
Contribution
We propose Neural RR (NRR), a differentiable neural network that learns the agent ordering for round robin allocations, enabling supervised learning of fair allocations from implicit rules.
Findings
NRR effectively learns EF1 allocations from data.
Our method outperforms baseline algorithms in allocation accuracy.
Neural network approach improves fairness and efficiency in resource distribution.
Abstract
The fair allocation of indivisible resources is a fundamental problem. Existing research has developed various allocation mechanisms or algorithms to satisfy different fairness notions. For example, round robin (RR) was proposed to meet the fairness criterion known as envy-freeness up to one good (EF1). Expert algorithms without mathematical formulations are used in real-world resource allocation problems to find preferable outcomes for users. Therefore, we aim to design mechanisms that strictly satisfy good properties with replicating expert knowledge. However, this problem is challenging because such heuristic rules are often difficult to formalize mathematically, complicating their integration into theoretical frameworks. Additionally, formal algorithms struggle to find preferable outcomes, and directly replicating these implicit rules can result in unfair allocations because human…
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
TopicsAuction Theory and Applications
